Document Open Access Logo

Constraint Satisfaction with Succinctly Specified Relations

Authors Hubie Chen, Martin Grohe



PDF
Thumbnail PDF

File

DagSemProc.06401.5.pdf
  • Filesize: 229 kB
  • 15 pages

Document Identifiers

Author Details

Hubie Chen
Martin Grohe

Cite AsGet BibTex

Hubie Chen and Martin Grohe. Constraint Satisfaction with Succinctly Specified Relations. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, pp. 1-15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.06401.5

Abstract

The general intractability of the constraint satisfaction problem has motivated the study of the complexity of restricted cases of this problem. Thus far, the literature has primarily considered the formulation of the CSP where constraint relations are given explicitly. We initiate the systematic study of CSP complexity with succinctly specified constraint relations. This is joint work with Hubie Chen.
Keywords
  • Constraint satisfaction
  • complexity
  • succinct representations

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