Contact
How to shop
Delivery
Shopping guide
Computational Complexity and Property Testing
On the Interplay Between Randomness and Computation
English
230 b
30-day return policy
Customers also purchased
/
Sheet
2 487
Ft
/
Paperback
24 115
Ft
/
Paperback
9 584
Ft
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
16 390
Ft
/
Hardback
17 853
Ft
/
Paperback
3 936
Ft
/
Paperback
4 651
Ft
/
Paperback
25 518
Ft
