Pages that link to "Item:Q4973888"
From MaRDI portal
The following pages link to Asking the Metaquestions in Constraint Tractability (Q4973888):
Displayed 12 items.
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- Local–global property for G-invariant terms (Q5097711) (← links)
- DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS (Q5148097) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- (Q5377468) (← links)
- (Q5381121) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
- The smallest hard trees (Q6073305) (← links)