Quantified Constraints in Twenty Seventeen

Author Barnaby Martin



PDF
Thumbnail PDF

File

DFU.Vol7.15301.327.pdf
  • Filesize: 467 kB
  • 20 pages

Document Identifiers

Author Details

Barnaby Martin

Cite AsGet BibTex

Barnaby Martin. Quantified Constraints in Twenty Seventeen. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 327-346, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/DFU.Vol7.15301.327

Abstract

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.
Keywords
  • Quantified constraints
  • Constraint satisfaction problems
  • Computational complexity
  • Parameterized complexity
  • Universal algebra

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail