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

Computational Complexity || Possibility Theory

โœ Scribed by Meyers, Robert A.

Book ID
127079539
Publisher
Springer New York
Year
2012
Weight
629 KB
Category
Article
ISBN
1461418003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Theory of computational complexity
Theory of computational complexity
โœ Ding-Zhu Du, Ker-I Ko ๐Ÿ“‚ Library ๐Ÿ“… 2000 ๐Ÿ› Wiley ๐ŸŒ English โš– 6 MB

Du and Ko present the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization.The book...is a graduate text...however, it can also be used profitably by researchers in theory...the selection by the authors of the book under review is excelle

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.