When do homomorphism counts help in query algorithms?
From MaRDI portal
Cites work
- A Characterisation of First-Order Constraint Satisfaction Problems
- A dichotomy theorem for nonuniform CSPs
- A new line of attack on the dichotomy conjecture
- A proof of CSP dichotomy conjecture
- Classification of annotation semirings over containment of conjunctive queries
- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
- Constraints, MMSNP and expander relational structures
- Containment of conjunctive queries on annotated relations
- Datalog vs first-order logic
- Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Homomorphism preservation theorems
- scientific article; zbMATH DE number 1953136 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Lov\'asz Meets Weisfeiler and Leman
- On algorithms based on finitely many homomorphism counts
- On recognizing graphs by numbers of homomorphisms
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Operations with structures
- The Complexity of Homomorphism Indistinguishability
- The Generalized Vandermonde Matrix
- Undecidable optimization problems for database logic programs
This page was built for publication: When do homomorphism counts help in query algorithms?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902082)
