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

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

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 | A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT | Lagerkvist, Victor et al. | 2016 |

Number of result pages: | 1 |

Number of documents: | 4 |