Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > COMPLEXITY CLASSIFICATION:
Reports tagged with complexity classification:
TR05-036 | 28th March 2005
Hubie Chen

Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms

The constraint satisfaction problem (CSP) is a convenient framework for modelling search problems; the CSP involves deciding, given a set of constraints on variables, whether or not there is an assignment to the variables satisfying all of the constraints. This paper is concerned with the quantified constraint satisfaction problem (QCSP), ... more >>>




ISSN 1433-8092 | Imprint