Existentially restricted quantified constraint satisfaction
type: Item
instance of: scholarly article
title: Existentially restricted quantified constraint satisfaction
zbMATH Open document ID: 1168.68017
author: Hubie Chen
published in: Information and Computation
publication date: 2009-04-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5544367
zbMATH Keywords: quantified constraint satisfaction
zbMATH Keywords: computational complexity
zbMATH Keywords: proof system
MaRDI profile type: Publication
full work available at URL: j.ic.2008.11.001
OpenAlex ID: W1986406042
cites work: Combinatorial problems raised from 2-semilattices
cites work: Q2754150
cites work: The complexity of maximal constraint languages
cites work: Resolution for quantified Boolean formulas
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: STACS 2005
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Q4495111
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: On the algebraic structure of combinatorial problems
cites work: Constraints, consistency and closure
cites work: Closure properties of constraints
cites work: The complexity of satisfiability problems
DOI: 10.1016/J.IC.2008.11.001
description: scientific article; zbMATH DE number 5544367