Opening book details…
Can I read Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science) on EtoBox?
Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science) by Andrej Bogdanov, Luca Trevisan is a nonfiction available to read on EtoBox.
What is Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science) about?
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.
Who reads Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Andrej Bogdanov, Luca Trevisan
- Publisher
- Now Publishers Inc
- Published
- 2006
- Language
- EN
- ISBN
- 9781429454803
- Category
- nonfiction
- Subjects
- Mathematics, Computer Science, Science
More by Andrej Bogdanov, Luca Trevisan
Browse all works by Andrej Bogdanov, Luca Trevisan
Similar books
- Pairwise Independence and Derandomization (Foundations and Trends(R) in Theoretical Computer Science) — Michael George Luby; Avi Wigderson (2005)
- A Survey of Lower Bounds for Satisfiability and Related Problems (Foundations and Trends(r) in Theoretical Computer Science) — Dieter Melkebeek van (2006)
- ALGORITHMIC RESULTS IN LIST DECODING (Foundations and Trends(R) in Theoretical Computer Science) — Venkatesan Guruswami (2006)
- Algorithms and Data Structures for External Memory (Foundations and Trends(R) in Theoretical Computer Science) — Associate Professor of Computer Science Jeffrey Scott Vitter (2006)
- Data Streams: Algorithms and Applications (Foundations and Trends in Theoretical Computer Science,) — S. Muthukrishnan (2005)
- Lower Bounds in Communication Complexity (Foundations and Trends in Theoretical Computer Science) — Adi Shraibman Troy Lee (2007)