Infinite domain constraint satisfaction problem
- Libor Barto (Charles University in Prague)
- Aug. 29, 2016, 9:00 - 10:00
The computational and descriptive complexity of finite domain fixed template constraint satisfaction problem (CSP) is a well developed topic that combines several areas in mathematics and computer science. Allowing the domain to be infinite provides a way larger playground which covers many more computational problems and requires further mathematical tools. I will talk about some of the research challenges and recent progress on them.