Computational Complexity and Property Testing

On the Interplay Between Randomness and Computation

Oded Goldreich (Redaktør) ; Itai Benjamini (Innledning) ; Scott Decatur (Innledning) ; Maya Leshkowitz (Innledning) ; Or Meir (Innledning) ; Dana Ron (Innledning) ; Guy Rothblum (Innledning) ; Avishay Tal (Innledning) ; Liav Teichner (Innledning) ; Roei Tell (Innledning)

Serie: Lecture Notes in Computer Science 12050

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. Les mer
Vår pris
1013,-

(Paperback) Fri frakt!
Leveringstid: Sendes innen 21 dager
På grunn av Brexit-tilpasninger og tiltak for å begrense covid-19 kan det dessverre oppstå forsinket levering

Vår pris: 1013,-

(Paperback) Fri frakt!
Leveringstid: Sendes innen 21 dager
På grunn av Brexit-tilpasninger og tiltak for å begrense covid-19 kan det dessverre oppstå forsinket levering

Om boka

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.

Fakta