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

Computational Complexity || Voting

โœ Scribed by Meyers, Robert A.

Book ID
120578244
Publisher
Springer New York
Year
2012
Weight
554 KB
Category
Article
ISBN
1461418003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computational complexity
Computational complexity
โœ Goldreich, Oded ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Association for Computing Machinery โš– 525 KB
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