Springer celebrates 175 years of publishing excellence! Join us >>

Theoretical Computer Science and General Issues

Complexity of Constraints

An Overview of Current Research Themes

Editors: Creignou, Nadia, Kolaitis, Phokion G., Vollmer, Heribert (Eds.)

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-92800-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-540-92799-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequently, it is important to analyze and pinpoint the computational complexity of certain algorithmic tasks related to constraint satisfaction. The complexity-theoretic results of these tasks may have a direct impact on, for instance, the design and processing of database query languages, or strategies in data-mining, or the design and implementation of planners. 

This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006. A number of speakers were solicited to write surveys presenting the state of the art in their area of expertise. These contributions were peer-reviewed by experts in the field and revised before they were collated to the 9 papers of this volume. In addition, the volume contains a reprint of a survey by Kolaitis and Vardi on the logical approach to constraint satisfaction that first appeared in 'Finite Model Theory and its Applications', published by Springer in 2007.

Table of contents (11 chapters)

  • Introduction

    Creignou, N.

    Pages 1-2

  • Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

    Creignou, Nadia (et al.)

    Pages 3-37

  • Basics of Galois Connections

    Börner, Ferdinand

    Pages 38-67

  • Recent Results on the Algebraic Approach to the CSP

    Bulatov, Andrei A. (et al.)

    Pages 68-92

  • Dualities for Constraint Satisfaction Problems

    Bulatov, Andrei A. (et al.)

    Pages 93-124

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-92800-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-540-92799-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Complexity of Constraints
Book Subtitle
An Overview of Current Research Themes
Editors
  • Nadia Creignou
  • Phokion G. Kolaitis
  • Heribert Vollmer
Series Title
Theoretical Computer Science and General Issues
Series Volume
5250
Copyright
2008
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-92800-3
DOI
10.1007/978-3-540-92800-3
Softcover ISBN
978-3-540-92799-0
Edition Number
1
Number of Pages
VII, 321
Topics