Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100 Book

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100, , Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100

3.5 out of 5 stars based on 2 reviews

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100
Written by author Madhu Sudan
Published by Springer-Verlag New York, LLC, November 2007
This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral Dissertation Competition. The author improved the presentation and included the progress achieved since the thesis was approved by the Universi

Buy Digital USD$99.99

1 Introduction 1
2 On the resilience of polynomials 15
3 Low-degree tests 23
4 Transparent proofs and the class PCP 47
5 Hardness of approximations 61
6 Conclusions 69
Bibliography 73
A. The Berlekamp Welch decoder 79
B. Composing proof systems 81
C. A characterization of NP via polynomial sequences 83
Index 86

Title: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100

Manufacturer:

Steidl Publishing

Item Number: 9783540606154

Publication Date: November 2007

Number: 1

Product Description: Full Name: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100; Short Name:Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Universal Product Code (UPC): 9783540606154

WonderClub Stock Keeping Unit (WSKU): 9783540606154

Rating: 3.5/5 based on 2 Reviews

Image Location: https://wonderclub.com/images/covers/61/54/9783540606154.jpg

Category: Media >> Books

Weight: 0.200 kg (0.44 lbs)

Width: 0.000 cm (0.00 inches)

Heigh : 0.000 cm (0.00 inches)

Depth: 0.000 cm (0.00 inches)

Date Added: August 25, 2020, Added By: Ross

Date Last Edited: August 25, 2020, Edited By: Ross

Price	Condition	Delivery	Seller	Action
$99.99	Digital	Arrives between Apr 20 - May 20 Login to your account for a direct download. Some files are emailed from Dropbox. Continent $0.00 - World $0.00	WonderClub (9294 total ratings)

Question Concerning Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Ask a Question about Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

No Question found!

Read Reviews for Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100 Write review

Jhon Alx

reviewed Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100 on August 14, 2014

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

An exceptional textbook for computer science. This is not among the very popular titles on the subject, but one of the best.

You must be logged in to add to Wishlist

This item is in your Wish List

This item is in your Collection

This Item is in Your Inventory

You must be logged in to review the products

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100, , Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100

Add Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100, , Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100 to the inventory that you are selling on WonderClub

Add Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100, , Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100 to your collection on WonderClub

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100 Book

Book Categories

Authors

Steidl Publishing

Question Concerning Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Read Reviews for Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Vol. 100 Write review

Login

Complaints

Blog

Games

Digital Media

Souls

Obituary

Contact Us

FAQ