## Proof verification and hardness of approximation problems (1992)

### Cached

### Download Links

- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [cgis.cs.umd.edu]
- [www.cs.umd.edu]
- [theory.csail.mit.edu]
- [theory.lcs.mit.edu]
- [people.csail.mit.edu]
- [theory.lcs.mit.edu]
- [theory.lcs.mit.edu]
- [people.csail.mit.edu]
- [ftp.cs.princeton.edu]
- [theory.stanford.edu]
- [www.cs.princeton.edu]
- DBLP

### Other Repositories/Bibliography

by
Sanjeev Arora
,
Carsten Lund
,
Rajeev Motwani
,
Madhu Sudan
,
Mario Szegedy

Venue: | IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI |

Citations: | 705 - 45 self |