Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > MINORITY-MAJORITY OPERATION:
Reports tagged with minority-majority operation:
TR06-160 | 17th December 2006
Tomas Feder, Phokion G. Kolaitis

Closures and dichotomies for quantified constraints

Quantified constraint satisfaction is the generalization of
constraint satisfaction that allows for both universal and existential
We study quantified constraint satisfaction problems ${\rm CSP}(Q,S)$, where $Q$ denotes