Average-Case Complexity (Repost)
Andrej Bogdanov, Luca Trevisan, "Average-Case Complexity"
2006 | pages: 122 | ISBN: 1933019492 | PDF | 11,9 mb
2006 | pages: 122 | ISBN: 1933019492 | PDF | 11,9 mb
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.
My Links