Algorithms for the Satisfiability Problem

by Jun Gu, etc., Paul W. Purdom, John Franco, and Benjamin W. Wah

0 ratings • 0 reviews • 0 shelved
Book cover for Algorithms for the Satisfiability Problem

Bookhype may earn a small commission from qualifying purchases. Full disclosure.

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.
  • ISBN10 0521640415
  • ISBN13 9780521640411
  • Publish Date 1 June 2020
  • Publish Status Out of Print
  • Out of Print 25 May 2021
  • Publish Country GB
  • Imprint Cambridge University Press
  • Format Hardcover
  • Pages 250
  • Language English