Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science)

✍ Scribed by Andrej Bogdanov, Luca Trevisan

• Book ID: 127404616
• Publisher: Now Publishers Inc
• Year: 2006
• Tongue: English
• Weight: 584 KB
• Volume: 2
• Category: Library
• City: Hanover, MA
• ISBN: 1933019492
• DOI: 10.1561/0400000004

✦ Synopsis

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.