Consistency for counting quantifiers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 979011 (Why is no real title available?)
- scientific article; zbMATH DE number 6930501 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 6028114 (Why is no real title available?)
- A Sufficient Condition for Backtrack-Free Search
- An optimal lower bound on the number of variables for graph identification
- Bi‐arc graphs and the complexity of list homomorphisms
- Classifying the Complexity of Constraints Using Finite Algebras
- Constraint satisfaction with counting quantifiers
- Constraints, consistency and closure
- List homomorphisms and circular arc graphs
- Near-Unanimity Functions and Varieties of Reflexive Graphs
- Surjective \texttt{H}-colouring over reflexive digraphs
- The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Cited in
(4)
This page was built for publication: Consistency for counting quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005107)