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 3152128 obálek a 950683 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Modern cryptography, probabilistic proofs and pseudorandomness
Autor: Goldreich, Oded
Rok: 1999
ISBN: 9770937551005
ISBN: 9783540647669
OKCZID: 110055038
Citace (dle ČSN ISO 690):
SCHRIJVER, A. Combinatorial optimization: polyhedra and efficiency . Berlin: Springer, c2003. xxxvii, 647 s. Algorithms and combinatorics, 24 ,.
Hodnocení:
4.5 / 5
(6 hlasů)
Anotace
The book focuses on three related areas in the theory of computation. The areas are modern cryptography, the study of probabilistic proof systems, and the theory of computational pseudorandomness. The common theme is the interplay between randomness and computation. The book offers an introduction and extensive survey to each of these areas, presenting both the basic notions and the most important (sometimes advanced) results. The presentation is focused on the essentials and does not elaborate on details. In some cases it offers a novel and illuminating perspective. The reader may obtain from the book 1. A clear view of what each of these areas is all above. 2. Knowledge of the basic important notions and results in each area. 3. New insights into each of these areas. It is believed that the book may thus be useful both to a beginner (who has only some background in the theory of computing), and an expert in any of these areas.