Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3152121 obálek a 950676 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science)
Rok: 2001
ISBN: 9783540414926
OKCZID: 110063123
Citace (dle ČSN ISO 690):
MELKEBEEK, Dieter van. Randomness and completeness i computational complexity. Berlin: Springer, 2000. xv, 196 s. Lecture notes in computer science, 1950.
Anotace
This book is based on the author's Ph.D. thesis which was selected as the winning thesis of the 1999 ACM Doctoral Dissertation Competition. Dieter van Melkebeek did his Ph.D. work at the University of Chicago with Lance Fortnow as thesis advisor. This work studies some central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. The author develops techniques for separating complexity classes by isolating structural differences between their complete problems. He presents several approaches based on such diverse concepts as density, redundancy, and frequency of occurrence.