• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Complexity of Constraints: An Overview of Current Research Themes

Complexity of Constraints: An Overview of Current Research Themes

Paperback

General ComputersGeneral Mathematics

ISBN10: 3540927999
ISBN13: 9783540927990
Publisher: Springer
Published: Dec 18 2008
Pages: 321
Weight: 1.05
Height: 0.90 Width: 6.10 Depth: 9.10
Language: English

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.

Also in

General Computers