No. |
Title |
Author |
Year |
---|

1 |
On the Strength of Uniqueness Quantification in Primitive Positive Formulas |
Lagerkvist, Victor et al. |
2019 |

2 |
A Dichotomy Theorem for the Inverse Satisfiability Problem |
Lagerkvist, Victor et al. |
2018 |

3 |
Why are CSPs Based on Partition Schemes Computationally Hard? |
Jonsson, Peter et al. |
2018 |

4 |
Time Complexity of Constraint Satisfaction via Universal Algebra |
Jonsson, Peter et al. |
2017 |

5 |
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT |
Lagerkvist, Victor et al. |
2016 |