Pages that link to "Item:Q2875201"
From MaRDI portal
The following pages link to Tractable hypergraph properties for constraint satisfaction and conjunctive queries (Q2875201):
Displaying 14 items.
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- Computing hypergraph width measures exactly (Q437685) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- Characterizing tractability of simple well-designed pattern trees with projection (Q2035467) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- (Q5091134) (← links)
- Quantum hypergraph states (Q5141597) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- (Q5743434) (← links)