Improved non-approximability results. Cynthia Dwork and Larry Stockmeyer. Interactive proofs and the hardness of approximating cliques. Uriel Feige and Joe Kilian. Uriel Feige and Joe Kilian.
Impossibility results for recycling random bits in two-prover proof systems.
Uriel Feige and Joe Kilian. Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, and Alan L. Selman. Dror Lapidot and Adi Shamir. Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan. Algebraic methods for interactive proof systems.