Quantified Constraint Satisfaction and the Polynomially Generated Powers Property

DOI10.1007/978-3-540-70583-3_17zbMath1155.68404MaRDI QIDQ3519502

Hubie Chen

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_17

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03B70: Logic in computer science

08A70: Applications of universal algebra in computer science

Related Items

On the growth of generating sets for direct powers of semigroups., A new line of attack on the dichotomy conjecture, The size of generating sets of powers

Cites Work

• Unnamed Item
• Unnamed Item
• The expressive rate of constraints
• Capturing complexity classes by fragments of second-order logic
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Resolution for quantified Boolean formulas
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• Varieties with few subalgebras of powers
• Generalized Majority-Minority Operations are Tractable
• On tractability and congruence distributivity
• Classifying the Complexity of Constraints Using Finite Algebras
• Tractability and Learnability Arising from Algebras with Few Subpowers
• Computer Science Logic
• The complexity of satisfiability problems
• A Simple Algorithm for Mal'tsev Constraints