Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions (1993)

Cached

Download Links

by Anne Condon , Joan Feigenbaum , Carsten Lund , Peter Shor
Venue:Extended abstract in Proc. 25-th ACM Symposium on Theory of Computing
Citations:32 - 7 self