0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing

Buy Now

A Survey of Lower Bounds for Satisfiability and Related Problems (Paperback) Loot Price: R1,609
Discovery Miles 16 090
A Survey of Lower Bounds for Satisfiability and Related Problems (Paperback): Dieter van Melkebeek
A Survey of Lower Bounds for Satisfiability and Related Problems (Paperback): Dieter van Melkebeek

Share your images

A Survey of Lower Bounds for Satisfiability and Related Problems (Paperback)

Dieter van Melkebeek

Series: Foundations and Trends in Theoretical Computer Science

 (sign in to rate)
Loot Price R1,609 Discovery Miles 16 090 | Repayment Terms: R150 pm x 12*

Bookmark and Share

Usually dispatched within 7 - 15 working days.

NP-completeness arguably forms the most pervasive concept from computer science as it captures the computational complexity of thousands of important problems from all branches of science and engineering. The P versus NP question asks whether these problems can be solved in polynomial time. A negative answer has been widely conjectured for a long time but, until recently, no concrete lower bounds were known on general models of computation. Satisfiability is the problem of deciding whether a given Boolean formula has at least one satisfying assignment. It is the first problem that was shown to be NP-complete, and is possibly the most commonly studied NP-complete problem, both for its theoretical properties and its applications in practice. A Survey of Lower Bounds for Satisfiability and Related Problems surveys the recently discovered lower bounds for the time and space complexity of satisfiability and closely related problems. It overviews the state-of-the-art results on general deterministic, randomized, and quantum models of computation, and presents the underlying arguments in a unified framework. A Survey of Lower Bounds for Satisfiability and Related Problems is an invaluable reference for professors and students doing research in complexity theory, or planning to do so.

General

Imprint: Now Publishers Inc
Country of origin: United States
Series: Foundations and Trends in Theoretical Computer Science
Release date: October 2007
First published: October 2007
Authors: Dieter van Melkebeek
Dimensions: 234 x 156 x 6mm (L x W x T)
Format: Paperback - Trade
Pages: 128
ISBN-13: 978-1-60198-084-7
Barcode: 9781601980847
Categories: Books > Computing & IT > General theory of computing
Books > Computing & IT > General theory of computing > General
Promotions
Books > Computing & IT > Applications of computing
Books > Computing & IT > Applications of computing > General
LSN: 1-60198-084-1

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Loyalty partners