๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational complexity

โœ Scribed by Goldreich, Oded

Book ID
127096062
Publisher
Association for Computing Machinery
Year
2008
Weight
525 KB
Volume
39
Category
Article
ISSN
0163-5700

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computational Complexity
Computational Complexity
โœ Christos H. Papadimitriou ๐Ÿ“‚ Library ๐Ÿ“… 1994 ๐Ÿ› Addison-Wesley ๐ŸŒ English โš– 5 MB

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.

Computational Complexity and Knowledge C
Computational Complexity and Knowledge Complexity
โœ Goldreich, Oded; Ostrovsky, Rafail; Petrank, Erez ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 405 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