Efficient probabilistically checkable proofs and applications approximationMihir BellareS. Goldwasseret al.1994STOC 1994Conference paper
Efficient probabilistically checkable proofs and applications to approximationMihir BellareS. Goldwasseret al.1993STOC 1993Conference paper
On the hardness of computing the permanent of random matricesUriel FeigeCarsten Lund1992STOC 1992Conference paper