Pages that link to "Item:Q1015812"
From MaRDI portal
The following pages link to The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812):
Displaying 16 items.
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- The complexity of equality constraint languages (Q929295) (← links)
- Bases for Boolean co-clones (Q1044708) (← links)
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- Two-element structures modulo primitive positive constructability (Q2310436) (← links)
- Weak bases of Boolean co-clones (Q2448853) (← links)
- Satisfiability with index dependency (Q2637283) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- (Q4993594) (← links)
- (Q5009475) (← links)
- Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320) (← links)
- An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
- (Q5381121) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- Forbidden tournaments and the orientation completion problem (Q6668354) (← links)
