Tractable hypergraph properties for constraint satisfaction and conjunctive queries
From MaRDI portal
(Redirected from Publication:2875201)
Recommendations
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries
- scientific article; zbMATH DE number 120352
- Structural tractability of counting of solutions to conjunctive queries
- Satisfiability on hypergraphs
- Consequence operations based on hypergraph satisfiability
- scientific article; zbMATH DE number 5762364
- Tractability beyond -acyclicity for conjunctive queries with negation and SAT
- Tractable structures for constraint satisfaction with truth tables
- Tractable structures for constraint satisfaction with truth tables
Cited in
(26)- The power of propagation: when GAC is enough
- Characterizing tractability of simple well-designed pattern trees with projection
- Tractability beyond -acyclicity for conjunctive queries with negation and SAT
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
- Structural tractability of enumerating CSP solutions
- Constructing NP-intermediate problems by blowing holes with parameters of various properties
- Computing partial hypergraphs of bounded width
- Hyperconsistency width for constraint satisfaction: Algorithms and complexity results
- Tractable counting of the answers to conjunctive queries
- The complexity of weighted counting for acyclic conjunctive queries
- Enumerating homomorphisms
- Computing hypergraph width measures exactly
- scientific article; zbMATH DE number 7561480 (Why is no real title available?)
- Quantum hypergraph states
- Tractable structures for constraint satisfaction with truth tables
- Tractable structures for constraint satisfaction with truth tables
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries
- On the complexity of existential positive queries
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- The complexity of conservative valued CSPs
- Point-Width and Max-CSPs
- The complexity of pattern counting in directed graphs, parameterised by the outdegree
- Point-width and max-CSPs
- Evaluating graph queries using semantic treewidth
- Fine-grained complexity of ontology mediated queries (invited paper)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
This page was built for publication: Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875201)
