Efficient checking of polynomials and proofs and the hardness of approximation problems, Madhu Sudan

Resource Information

The instance Efficient checking of polynomials and proofs and the hardness of approximation problems, Madhu Sudan represents a material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Instance, Electronic.

The Resource Efficient checking of polynomials and proofs and the hardness of approximation problems, Madhu Sudan

Image: http://images.btol.com/ContentCafe/Jacket.aspx?UserID=ebsco-test&Password=ebsco-test&Return=T&Value=9783540484851&Type=L

Label: Efficient checking of polynomials and proofs and the hardness of approximation problems, Madhu Sudan

Note: Based on the author's Ph. D. thesis, University of California, Berkeley, 1993

Bibliography note: Includes bibliographical references (pages 73-78) and index

Carrier category code

Content type code

Contents: 1. Introduction -- 2. On the resilience of polynomials -- 3. Low-degree tests -- 4. Transparent proofs and the class PCP -- 5. Hardness of approximations -- 6. Conclusions -- A. The Berlekamp Welch decoder -- B. Composing proof systems -- C.A characterization of NP via polynomial sequences

Media type code

Context

Context of Efficient checking of polynomials and proofs and the hardness of approximation problems, Madhu Sudan