BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Complexity of Constraints : An Overview of Current Research Themes

Complexity of Constraints : An Overview of Current Research Themes

Complexity of Constraints : An Overview of Current Research Themes Paperback - 2008

by Nadia Creignou (Editor); Phokion G. Kolaitis (Editor); Heribert Vollmer (Editor)

Add to wish list
  • New
  • Paperback
New

Description

Paperback. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; 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.
Ask the seller a question Add to wish list
A$105.30
A$15.59 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)

Details

  • Title Complexity of Constraints : An Overview of Current Research Themes
  • Author Nadia Creignou (Editor); Phokion G. Kolaitis (Editor); Heribert Vollmer (Editor)
  • Binding Paperback
  • Edition Us Edition
  • Condition New
  • Pages 321
  • Volumes 1
  • Language ENG
  • Publisher Springer, Germany
  • Publication date 2008-12-18
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # ria9783540927990_inp
  • ISBN 9783540927990 / 3540927999
  • Weight 1.05 lbs (0.48 kg)
  • Dimensions 9.1 x 6.1 x 0.9 in (23.11 x 15.49 x 2.29 cm)
  • Category Computers - General Information
  • Dewey Decimal Code 004
  • Quantity available 52

About Ria Christie Collections Greater London, United Kingdom

Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Ria Christie Collections

Reader reviews for Complexity of Constraints : An Overview of Current Research Themes

From the publisher

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.

From the rear cover

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.

tracking-