# Proof Verification and the Hardness of Approximation Problems

Credited to: Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy

Canonical: https://www.synapsebooks.app/catalog/proof-verification-and-the-hardness-of-approximation-problems

Status: Discovery record. No guide is published.

## Focus

Supplied bibliography entry.

## The Library, Volume IV

Listed title: Proof Verification and the Hardness of Approximation Problems

Listed credit: Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy

Publication details: Not supplied

Source shelf: 3. Theory & Algorithms

Source line: 261

Group: Papers

Difficulty: 3

No supplied note

Catalog metadata from the supplied bibliography. Edition and access verification pending.

## Find the original

Edition verification pending. [Search Open Library](https://openlibrary.org/search?title=Proof+Verification+and+the+Hardness+of+Approximation+Problems&author=Sanjeev+Arora%2C+Carsten+Lund%2C+Rajeev+Motwani%2C+Madhu+Sudan%2C+Mario+Szegedy)

This discovery record is not a book summary. Named editorial approval of guide text remains pending.
