Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Computational Complexity and Property Testing
On the Interplay Between Randomness and Computation
Engleski
212 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
List
6.77
€
/
Meki uvez
62.62
€
/
Meki uvez
25.18
€
This volume contains a collection of studies in the areas of complexity theory and property testing. The 21 pieces of scientific work included were conducted at different times, mostly during the last decade. Although most of these works have been cited in the literature, none of them was formally published before. Within complexity theory the topics include constant-depth Boolean circuits, explicit construction of expander graphs, interactive proof systems, monotone formulae for majority, probabilistically checkable proofs (PCPs), pseudorandomness, worst-case to average-case reductions, and zero-knowledge proofs. Within property testing the topics include distribution testing, linearity testing, lower bounds on the query complexity (of property testing), testing graph properties, and tolerant testing. A common theme in this collection is the interplay between randomness and computation.
Informacije o knjizi
Engleski
Kategorija
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
44.10
€
/
Tvrdi uvez
46.84
€
/
Meki uvez
10.31
€
/
Meki uvez
11.93
€
/
Meki uvez
68.69
€
