Pages that link to "Item:Q814599"
From MaRDI portal
The following pages link to The complexity of constraint satisfaction problems for small relation algebras (Q814599):
Displaying 9 items.
- On computation complexity problems concerning relation algebras (Q1329260) (← links)
- Finite relation algebras with normal representations (Q1617803) (← links)
- NP-completeness of small conflict set generation for congruence closure (Q1688538) (← links)
- Revision of defeasible preferences (Q1726329) (← links)
- Expressive power and complexity in algebraic logic (Q4344697) (← links)
- (Q4375762) (← links)
- Hardness of Network Satisfaction for Relation Algebras with Normal Representations (Q5098711) (← links)
- On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (Q5369245) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)