Complexity of Computation
โ R. Karp
๐ Library
๐
1974
๐ Amer Mathematical Society
๐ English
โฆ LIBER โฆ
๐
complexity of computation
- Tongue
- English
- Category
- Library
โฌ Acquire This Volume
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Randomness and Completeness in Computati
โ 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
โ 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
P, NP, and NP-Completeness: The Basics o
โ Oded Goldreich
๐ Library
๐
2010
๐ Cambridge University Press
๐ English
The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of solutions
P, NP, and NP-completeness: The basics o
โ Goldreich O.
๐ Library
๐
2010
๐ CUP
๐ English
The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of solutions
Arithmetic complexity of computations
โ Shmuel Winograd
๐ Library
๐
1987
๐ Society for Industrial and Applied Mathematics
๐ English
Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms. <P>Results that lead to applicati