𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational Complexity

✍ Scribed by Christos H. Papadimitriou

Book ID
127424747
Publisher
Addison-Wesley
Year
1994
Tongue
English
Weight
5 MB
Category
Library
City
Reading, Mass
ISBN-13
9780201530827

No coin nor oath required. For personal study only.

✦ Synopsis

Offers a comprehensive and accessible treatment of the theory of algorithms and complexity. Develops all the necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics, and probability. DLC: Computational complexity.

✦ Subjects

Дискретная математика

📜 SIMILAR VOLUMES

Computational complexity
Computational complexity
✍ Goldreich, Oded 📂 Article 📅 2008 🏛 Association for Computing Machinery ⚖ 525 KB
Kolmogorov Complexity and Computational
Kolmogorov Complexity and Computational Complexity
✍ Osamu Watanabe 📂 Library 📅 1992 🏛 Springer 🌐 English ⚖ 3 MB

There are many ways to measure the complexity of a given object, but there are two measures of particular importance in the theory of computing: One is Kolmogorov complexity, which measures the amount of information necessary to describe an object. Another is computational complexity, which measures

Computational Sample Complexity
Computational Sample Complexity
✍ Decatur, Scott E.; Goldreich, Oded; Ron, Dana 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 466 KB