Quantified constraint satisfaction and the polynomially generated powers property
type: Item
instance of: scholarly article
title: Quantified constraint satisfaction and the polynomially generated powers property
zbMATH Open document ID: 1216.68124
author: Hubie Chen
published in: Algebra Universalis
publication date: 2011-06-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B10
Mathematics Subject Classification ID: 08A70
zbMATH DE Number: 5902942
MaRDI profile type: Publication
full work available at URL: s00012-011-0125-4
OpenAlex ID: W2046586055
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Constraint Satisfaction Problems of Bounded Width
cites work: Varieties with few subalgebras of powers
cites work: Computer Science Logic
cites work: A Simple Algorithm for Mal'tsev Constraints
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set
cites work: Resolution for quantified Boolean formulas
cites work: The expressive rate of constraints
cites work: The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Generalized Majority-Minority Operations are Tractable
cites work: Capturing complexity classes by fragments of second-order logic
cites work: On the algebraic structure of combinatorial problems
cites work: Closure properties of constraints
cites work: Q3815282
cites work: On tractability and congruence distributivity
cites work: Q3751631
cites work: The complexity of satisfiability problems
cites work: Q3739181
DOI: 10.1007/S00012-011-0125-4
description: scientific article; zbMATH DE number 5902942