| 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 | On the Strength of Uniqueness Quantification in Primitive Positive Formulas | Lagerkvist, Victor et al. | 2019 |
| 3 | A Dichotomy Theorem for the Inverse Satisfiability Problem | Lagerkvist, Victor et al. | 2018 |
| 4 | Why are CSPs Based on Partition Schemes Computationally Hard? | Jonsson, Peter et al. | 2018 |
| 5 | Time Complexity of Constraint Satisfaction via Universal Algebra | Jonsson, Peter et al. | 2017 |
| 6 | A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT | Lagerkvist, Victor et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |