| 17-01-2020 |
Automatic constraint satisfaction problems
Study of decidability in infinite constraint satisfaction problems (CSP), with a focus in the automatic case: understanding basic concepts, collecting bibliography, learning about state-of-the-art.
Prerequisites:
None.
Evaluation method: Nota 1-7, with 0/1 available vacants |
Mentor(s): Open in the plataform |