Randomness and Completeness in Computational Complexity (eBook, PDF)

Randomness and Completeness in Computational Complexity (eBook, PDF)

Versandkostenfrei!
Sofort per Download lieferbar
40,95 €
inkl. MwSt.
Alle Infos zum eBook verschenken
Weitere Ausgaben:
PAYBACK Punkte
20 °P sammeln!
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 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size...

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.