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. |
Other books on Computer Science
Computable Models of the Law: Languages, Dialogues, Games, Ontologies (Lecture Notes in Computer Science) Numerical Geometry of Non-Rigid Shapes (Monographs in Computer Science) Formal Modeling and Analysis of Timed Systems: 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008, Proceedings (Lecture Notes in Computer Science) Developments in Language Theory: 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings (Lecture Notes in Computer Science) Advanced Data Structures A Second Course in Formal Languages and Automata Theory Transactions on Rough Sets VIII (Lecture Notes in Computer Science) Advances in Web Information Systems Engineering: WISE 2008 International Workshops, Auckland, New Zealand, September 1-4, 2008, Proceedings (Lecture Notes in Computer Science) Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings (Lecture Notes in Computer Science) Advances in Databases and Information Systems: 12th East European Conference, ADBIS 2008, Pori, Finland, September 5-9, 2008, Proceedings (Lecture Notes in Computer Science) Unconventional Computation: 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008, Proceedings (Lecture Notes in Computer Science) Mathematical Foundations of Computer Science 2008: 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings (Lecture Notes in Computer Science) Smart Graphics: 9th International Symposium, SG 2008, Rennes, France, August 27-29, 2008, Proceedings (Lecture Notes in Computer Science) Engines of Logic: Mathematicians and the Origin of the Computer Secure Transaction Protocol Analysis: Models and Applications (Lecture Notes in Computer Science)
|
|