Picture 1 of 1
Picture 1 of 1
Survey of Lower Bounds for Satisfiability and Related Problems, Paperback by ...
GBP 75.21
ApproximatelyPHP 5,617.92
Condition:
Brand New
A new, unread, unused book in perfect condition with no missing or damaged pages.
2 available
Postage:
GBP 15.99 (approx PHP 1,194.40) Standard Int'l Postage.
Located in: Castle Donington, United Kingdom
Delivery:
Estimated between Thu, 17 Oct and Tue, 29 Oct to 43230
Returns:
30 days return. Buyer pays for return shipping.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:386896100794
Item specifics
- Condition
- Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
- Book Title
- Survey of Lower Bounds for Satisfiability and Related Problems
- ISBN
- 9781601980847
- Publication Name
- A Survey of Lower Bounds for Satisfiability and Related Problems
- Publisher
- Now Publishers INC International Concepts
- Subject
- Computer Science
- Series
- Foundations and Trends (R) in Theoretical Computer Science
- Publication Year
- 2007
- Type
- Textbook
- Format
- Paperback
- Language
- English
- Item Height
- 234 mm
- Item Width
- 156 mm
- Item Weight
- 191 g
- Number of Pages
- 128 Pages
About this product
Product Information
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. This is an invaluable reference for professors and students doing research in complexity theory, or planning to do so.
Product Identifiers
Publisher
Now Publishers INC International Concepts
ISBN-13
9781601980847
eBay Product ID (ePID)
88406449
Product Key Features
Series
Foundations and Trends (R) in Theoretical Computer Science
Publication Name
A Survey of Lower Bounds for Satisfiability and Related Problems
Format
Paperback
Language
English
Subject
Computer Science
Publication Year
2007
Type
Textbook
Number of Pages
128 Pages
Dimensions
Item Height
234 mm
Item Width
156 mm
Item Weight
191 g
Additional Product Features
Country/Region of Manufacture
United States
Item description from the seller
Business seller information
Value Added Tax Number:
- GB 307932304
Seller feedback (83,754)
- l***l- Feedback left by buyer.Past monthVerified purchaseItem was as described with super speedy delivery terrific ensure A*****
- w***w (440)- Feedback left by buyer.Past monthVerified purchasevery useful
- 2***2 (7)- Feedback left by buyer.Past monthVerified purchaseBook in fabulous condition as new, delivery great considering come from USA