DFU.Vol7.15301.327.pdf
- Filesize: 467 kB
- 20 pages
I present a survey of recent advances in the algorithmic and computational complexity theory of non-Boolean Quantified Constraint Satisfaction Problems, incorporating some more modern research directions.
Feedback for Dagstuhl Publishing