Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Algorithms for the Satisfiability Problem, Hardback Book

Algorithms for the Satisfiability Problem Hardback

Hardback

Item not Available

Description

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.

Information

Save 3%

£30.00

£29.05

Item not Available
Item not Available
Sign in to add to wishlist
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information