£150.00

Satisfiability Problem: Theory and Applications (Series in Discrete Mathematics and Theoretical Computer Science)

Architecture & Microprocessors

Price data last checked 138 day(s) ago - refreshing...

View at Amazon

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

It has never been this cheap. We have no record of a lower price.

£150 today · cheaper than every other day in the last 19 months

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 432 days • 432 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 432 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £190 (379 days, 87.7%)

Price range: £150 - £190

Price levels: 2 different prices over 432 days

Description

The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmists, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications.

Product Specifications

Format: hardcover
ASIN: 0821804790
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 19 February 1998
Listed Since: 17 October 2006

Barcode

No barcode data available

Satisfiability Problem: Theory and Applications (Series in Discrete Mathematics and Theoretical Computer Science)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Theory and Applications of Satisfiability Testing – SAT 2021: 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings: 12831 (Lecture Notes in Computer Science, 12831)

Handbook of Satisfiability: Second Edition (Frontiers in Artificial Intelligence and Applications (IOS Press))

SAT 2005: Satisfiability Research in the Year 2005

Springer SAT 2005: Satisfiability Research in the Year 2005

Mathematical Aspects of Logic Programming Semantics (Chapman & Hall/CRC Studies in Informatics Series)

The Mathematics of Logic: A Guide to Completeness Theorems and their Applications

Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II: 12167 (Lecture Notes in Computer Science, 12167)

Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series)

Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets (Monographs in Computer Science)

Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I: 12166 (Lecture Notes in Computer Science, 12166)

Philosophical Logic: Current Trends in Asia: Proceedings of AWPL-TPLC 2016 (Logic in Asia: Studia Logica Library)

Decidability of Logical Theories and Their Combination (Studies in Universal Logic)

Logic for Computer Science and Artificial Intelligence

Lectures in Logic and Set Theory: 83 (Cambridge Studies in Advanced Mathematics, Series Number 83)

Symbolic Logic (Palgrave Philosophy Today)

Mathematical Logic and Formalized Theories: A Survey of Basic Concepts and Results

Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9–18, 1995: 11 (Lecture Notes in Logic, Series Number 11)

The Logic of Sortals: A Conceptualist Approach: 408 (Synthese Library, 408)

Logic for Applications (Texts in Computer Science)

Set Theory: Boolean-Valued Models and Independence Proofs (Oxford Logic Guides): 47

A Formalization of Set Theory without Variables (Colloquium Publications)

Art of Computer Programming, The, Volumes 1-4B, Boxed Set: Fundamental Algorithms / Seminumerical Algorithms / Sorting and Searching / Combinatorial ... Part 1 / Combinatorial Algorithms, Part 2