Summary: Probabilistic Checking of Proofs
Hardness of Approximation Problems
(Revised version of a dissertation submitted at
CS Division, UC Berkeley, in August 1994)
Princeton techreports are available in postscript form via anonymous ftp from ftp.cs.princeton.edu
(InterNet address 188.8.131.52). You may log in as anonymous, and give your email ad
dress as password. Change to the directory reports. The file README gives details, and the
file INDEX lists the numbers and the titles of all reports. This report is numbered 47694.
Hardcopies of this report are available for a charge of $9.50 (only US dollar checks
accepted) from the following address.
Department of Computer Science
35 Olden Street
Princeton, NJ 085442087
Probabilistic Checking of Proofs