The following pages link to (Q4411838):
Displaying 13 items.
- Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Isomorphic implication (Q2272203) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- The complexity of equivalence and isomorphism of systems of equations over finite groups (Q2575758) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism (Q2817999) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism1 (Q5015600) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
