Item description for Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science) by Andrej Bogdanov...
Average-Case Complexity is a thorough survey of the average-case complexity of problems in NP. The study of the average-case complexity of intractable problems began in the 1970s, motivated by two distinct applications: the developments of the foundations of cryptography and the search for methods to "cope" with the intractability of NP-hard problems. This survey looks at both, and generally examines the current state of knowledge on average-case complexity. Average-Case Complexity is intended for scholars and graduate students in the field of theoretical computer science. The reader will also discover a number of results, insights, and proof techniques whose usefulness goes beyond the study of average-case complexity.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.1" Width: 6.1" Height: 0.3" Weight: 0.4 lbs.
Release Date Dec 10, 2006
Publisher Now Publishers Inc
ISBN 1933019492 ISBN13 9781933019499
Availability 109 units. Availability accurate as of Jan 17, 2017 10:28.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.