Complexity Classifications of Boolean Constraint Satisfaction Problems (Monographs on Discrete Mathematics and Applications): 7 (Monographs on Discrete Mathematics and Applications, Series Number 7) - Image 1

£65.37

Society for Industrial and Applied Mathematics (SIAM) Complexity Classifications of Boolean Constraint Satisfaction Problems (Monographs on Discrete Mathematics and Applications): 7 (Monographs on Discrete Mathematics and Applications, Series Number 7)

Name: Complexity Classifications of Boolean Constraint Satisfaction Problems (Monographs on Discrete Mathematics and Applications): 7 (Monographs on Discrete Mathematics and Applications, Series Number 7)
Brand: Society for Industrial and Applied Mathematics (SIAM)
Price: 65.37 GBP
Availability: InStock

Architecture & Microprocessors

Price data last checked 24 day(s) ago - will refresh soon

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

About as cheap as it gets. The only time it was cheaper was 2 months ago.

£65 today · all-time low £65 (Jun 2026) · usually £65

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 54 days · 54 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 54 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £65 (37 days, 68.5%)

Price range: £65 - £66

Price levels: 2 different prices over 54 days

Description

Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating 'global' inferences about the nature of computation. This book presents a novel and compact form of a compendium that classifies an infinite number of problems by using a rule-based approach. This enables practitioners to determine whether or not a given problem is known to be computationally intractable.

Product Specifications

Brand: Society for Industrial and Applied Mathematics (SIAM)
Format: hardcover
ASIN: 0898714796
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 01 January 1987
Listed Since: 30 September 2005

Barcode

No barcode data available

Society for Industrial and Applied Mathematics (SIAM) Complexity Classifications of Boolean Constraint Satisfaction Problems (Monographs on Discrete Mathematics and Applications): 7 (Monographs on Discrete Mathematics and Applications, Series Number 7)

About as cheap as it gets. The only time it was cheaper was 2 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The Complexity of Valued Constraint Satisfaction Problems (Cognitive Technologies)

Boolean Representations of Simplicial Complexes and Matroids (Springer Monographs in Mathematics)

Topics in Intersection Graph Theory (Monographs on Discrete Mathematics and Applications): 2 (Monographs on Discrete Mathematics and Applications, Series Number 2)

Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)

Cambridge Logical Foundations of Proof Complexity Book

Numerical Linear Algebra on High-Performance Computers (Software, Environments and Tools): 7 (Software, Environments and Tools, Series Number 7)

Handbook of Parallel Constraint Reasoning

Domain-Based Parallelism and Problem Decomposition Methods in Computational Science and Engineering

Simplicity is Complex: Foundations of Cyber-Physical System Design

Graph Classes: A Survey (Monographs on Discrete Mathematics and Applications): 3 (Monographs on Discrete Mathematics and Applications, Series Number 3)

Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)

An Introduction to Formal Languages and Machine Computation

State-Space Search: Algorithms, Complexity, Extensions, and Applications

Semidefinite Optimization and Convex Algebraic Geometry (MPS-SIAM Series on Optimization): 13 (MPS-SIAM Series on Optimization, Series Number 13)

Boolean Constructions in Universal Algebras: 242 (Mathematics and Its Applications, 242)

Lectures on the Logic of Computer Programming (CBMS-NSF Regional Conference Series in Applied Mathematics): 31 (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 31)

Combinatorial Machine Learning: A Rough Set Approach: 360 (Studies in Computational Intelligence, 360)

Complex Networks VII: Proceedings of the 7th Workshop on Complex Networks CompleNet 2016: 644 (Studies in Computational Intelligence, 644)

Complex Networks VII: Proceedings of the 7th Workshop on Complex Networks CompleNet 2016: 644 (Studies in Computational Intelligence, 644)

Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7)

Boolean Algebras in Analysis: 540 (Mathematics and Its Applications, 540)

Entropy, Search, Complexity: 16 (Bolyai Society Mathematical Studies, 16)

Complex Pattern Mining: New Challenges, Methods and Applications: 880 (Studies in Computational Intelligence, 880)

Advanced Computational Methods for Knowledge Engineering: Proceedings of the 2nd International Conference on Computer Science, Applied Mathematics and ... in Intelligent Systems and Computing, 282)