Efficient Probabilistically Checkable Proofs and Applications to Approximations

Jan 1, 1993·
Mihir Bellare
,
Shafi Goldwasser
,
Carsten Lund
,
Alexander Russell
· 0 min read
Type
Publication
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC)