Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Computational Complexity and Property Testing
On the Interplay Between Randomness and Computation
Angličtina
200 b
30 dní na vrácení zboží
Zákazníci také koupili
/
List
170
Kč
/
Brožovaná
1 434
Kč
/
Brožovaná
582
Kč
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.
Informace o knize
Angličtina
Kategorie
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
1 014
Kč
/
Pevná
1 077
Kč
/
Brožovaná
236
Kč
/
Brožovaná
271
Kč
/
Brožovaná
1 578
Kč
