Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science) PDF
122 Pages·2006·11.921 MB·English
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
Preview Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science)
Description:
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.
See more
The list of books you might like
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
