CART

(0) items

Algorithms for the Satisfiability Problem,9780521640411

Algorithms for the Satisfiability Problem

by
ISBN13:

9780521640411

ISBN10:
0521640415
Format:
Hardcover
Pub. Date:
1/30/2015
Publisher(s):
Cambridge Univ Pr
List Price: $44.95

Buy New Textbook

Not Yet Printed. Place an order and we will ship it as soon as it arrives.
N9780521640411
$43.83

Rent Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

Questions About This Book?

What version or edition is this?
This is the edition with a publication date of 1/30/2015.
What is included with this book?
  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any CDs, lab manuals, study guides, etc.

Summary

The satisfiability (SAT) problem is central in mathematical logic and computing theory, representing a core of computationally intractable NP-complete problems. It is a fundamental hurdle in solving many problems in automated reasoning, computer-aided design, computer-aided manufacturing, machine vision, database construction and maintenance, robotics, scheduling, integrated circuit design, computer architecture design, and computer networking. Efficient methods for solving the SAT problem play an important role in the development of practical computing systems. Traditional methods treat SAT as a discrete, constrained decision problem. In recent years, many optimization methods, parallel algorithms, and other practical new techniques have been developed for solving the SAT problem. This book describes these state-of-the-art methods, both sequential and parallel, and discusses tradeoffs and limitations in the rapidly growing field of satisfiability testing. It will be useful for computer theorists, algorithmists, and practitioners working in all areas in computer science, computer engineering, operations research, and applied logic.


Please wait while the item is added to your cart...