Non-deterministic exponential time has two-prover interactive protocols. (1991)

by Laszlo Babai, Lance Fortnow, Carsten Lund
Venue:Computational Complexity,