Computational Complexity: A Quantitative
β Marius Zimand (Eds.)
π Library
π
2004
π Elsevier Science
π English
There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we wa