A Survey of Lower Bounds for Satisfiability and Related Problems

By Dieter van Melkebeek and Dieter Melkebeek van

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... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 1601980841
• ISBN13: 9781601980847
• Release Date: October 2007
• Publisher: Now Publishers
• Length: 128 Pages
• Weight: 0.42 lbs.
• Dimensions: 0.3" x 6.1" x 9.2"