✦ LIBER ✦

Theory of computational complexity

✍ Scribed by Ding-Zhu Du, Ker-I Ko

Book ID: 127434432
Publisher: Wiley
Year: 2000
Tongue: English
Weight: 6 MB
Category: Library
City: New York
ISBN-13: 9780471345060

No coin nor oath required. For personal study only.

✦ Synopsis

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 excellent

✦ Subjects

Теория алгоритмов

📜 SIMILAR VOLUMES

Computational Complexity || Possibility

Computational Complexity || Possibility Theory

✍ Meyers, Robert A. 📂 Article 📅 2012 🏛 Springer New York ⚖ 629 KB

Progress in Computational Complexity The

Progress in Computational Complexity Theory

✍ Jin-Yi Cai; Hong Zhu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 531 KB

Relativization of the Theory of Computat

Relativization of the Theory of Computational Complexity

✍ Nancy Ann Lynch, Albert R. Meyer and Michael J. Fischer 📂 Article 📅 1976 🏛 American Mathematical Society 🌐 English ⚖ 1022 KB

The pervasive reach of resource-bounded

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

✍ Eric Allender; Michal Koucký; Detlef Ronneburger; Sambuddha Roy 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Computational complexity

✍ Goldreich, Oded 📂 Article 📅 2008 🏛 Association for Computing Machinery ⚖ 525 KB

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.