Computational Complexity and Property Testing
Oded Goldreich
Sold by PBShop.store UK, Fairford, GLOS, United Kingdom
AbeBooks Seller since June 11, 1999
New - Soft cover
Condition: New
Quantity: 1 available
Add to basketSold by PBShop.store UK, Fairford, GLOS, United Kingdom
AbeBooks Seller since June 11, 1999
Condition: New
Quantity: 1 available
Add to basketNew Book. Shipped from UK. Established seller since 2000.
Seller Inventory # GB-9783030436612
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.
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 this title" may belong to another edition of this title.
Returns Policy
We ask all customers to contact us for authorisation should they wish to return their order. Orders returned without authorisation may not be credited.
If you wish to return, please contact us within 14 days of receiving your order to obtain authorisation.
Returns requested beyond this time will not be authorised.
Our team will provide full instructions on how to return your order and once received our returns department will process your refund.
Please note the cost to return any...
Orders are shipped from our UK warehouse. Delivery thereafter is between 4 and 14 business days. Please contact us if you have any queries about our services or products.
Order quantity | 10 to 17 business days | 10 to 17 business days |
---|---|---|
First item | US$ 6.78 | US$ 6.78 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.