| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors | Jonsson, Peter et al. | 2021 |
| 2 | Why are CSPs Based on Partition Schemes Computationally Hard? | Jonsson, Peter et al. | 2018 |
| 3 | Time Complexity of Constraint Satisfaction via Universal Algebra | Jonsson, Peter et al. | 2017 |
| 4 | The Complexity of Phylogeny Constraint Satisfaction | Bodirsky, Manuel et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |