Computational Complexity and Property Testing
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) Avi Wigderson (Innledning)
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
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.
Detaljer
- Forlag
- Springer Nature Switzerland AG
- Innbinding
- Paperback
- Språk
- Engelsk
- Sider
- 382
- ISBN
- 9783030436612
- Utgivelsesår
- 2020
- Format
- 24 x 16 cm