Computational Complexity

✍ Christos H. Papadimitriou 📂 Library 📅 1993 🏛 Addison Wesley 🌐 English

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

✍ Christos H. Papadimitriou 📂 Library 📅 1993 🏛 Addison-Wesley 🌐 English

This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reduc

Randomness and Completeness in Computati

📁 Randomness and Completeness in Computational Complexity

✍ Dieter van Melkebeek (auth.) 📂 Library 📅 2000 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1

Randomness and Completeness in Computati

📁 Randomness and Completeness in Computational Complexity

✍ Dieter van Melkebeek (auth.) 📂 Library 📅 2000 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1

Kolmogorov Complexity and Computational

📁 Kolmogorov Complexity and Computational Complexity

✍ Osamu Watanabe 📂 Library 📅 1992 🏛 Springer 🌐 English

<p>The mathematical theory of computation has given rise to two important ap proaches to the informal notion of "complexity": Kolmogorov complexity, usu ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the obj

Kolmogorov Complexity and Computational

📁 Kolmogorov Complexity and Computational Complexity

✍ Osamu Watanabe 📂 Library 📅 1992 🏛 Springer 🌐 English

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 Complexity

✦ Synopsis

✦ Subjects