Computational Complexity and Property TestingAuthor :
Paperback
Published : Saturday 4 April 2020
Description
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.
You may also like ...
by
Paperback
04 Apr 2020
Algorithms and data structures
€87.74
Extended stock – Dispatch 5-7 days
by
Hardback
23 Nov 2017
Algorithms and data structures
€92.42
Extended stock – Dispatch 5-7 days
by
Paperback
30 Aug 2010
Mathematics
€71.37
Extended stock – Dispatch 5-7 days
by
Paperback
16 Aug 2010
Mathematical theory of computation
€44.45
Extended stock – Dispatch 5-7 days
Reviews