Opening book details…
Can I read Complexity of Constraints: An Overview of Current Research Themes (Lecture Notes in Computer Science, 5250) on EtoBox?
Complexity of Constraints: An Overview of Current Research Themes (Lecture Notes in Computer Science, 5250) by Nadia Creignou (editor), Phokion G. Kolaitis (editor), Heribert Vollmer (editor) is a computer science book available to read on EtoBox.
What is Complexity of Constraints: An Overview of Current Research Themes (Lecture Notes in Computer Science, 5250) about?
<p>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 proces
Who reads Complexity of Constraints: An Overview of Current Research Themes (Lecture Notes in Computer Science, 5250)?
It is typically read by working professionals who need an authoritative practice reference.
Common subject areas: medicine, law, business, engineering.
- Author
- Nadia Creignou (editor), Phokion G. Kolaitis (editor), Heribert Vollmer (editor)
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008
- Language
- EN
- ISBN
- 9783540927990
- Category
- computer science
- Subjects
- Management, Mathematics, Engineering
- Updated
- 2026-03-25
Other editions & translations
More by Nadia Creignou (editor), Phokion G. Kolaitis (editor), Heribert Vollmer (editor)
Browse all works by Nadia Creignou (editor), Phokion G. Kolaitis (editor), Heribert Vollmer (editor)
Similar books
- Component-Based Software Development for Embedded Systems: An Overview of Current Research Trends (Lecture Notes in Computer Science, 3778) — Colin Atkinson, Christian Bunse, Christian Peper, Hans-Gerhard Gross (auth.), (2005)
- Lecture Notes in Computer Science 2962 Semirings for Soft Constraint Solving and Programming — Stefano Bistarelli (auth.) (2004)
- Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition (Lecture Notes in Computer Science, 4929) — Malte Helmert (auth.) (2008)
- Parameterized Complexity In The Polynomial Hierarchy: Extending Parameterized Complexity Theory To Higher Levels Of The Hierarchy (lecture Notes In Computer Science) (2019)
- Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings (Lecture Notes in Computer Science) — Kurt Mehlhorn (auth.), Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (2006)
- Constraint Processing: Selected Papers (lecture Notes In Computer Science) — Andreas Podelski, Peter Van Roy (auth.), Manfred Meyer (1995)