BPP has subexponential time simulations unlessEXPTIME has publishable proofs Lźszló BabaiLance FortnowAvi Wigderson OriginalPaper Pages: 307 - 318
Randomness in interactive proofs Mihir BellareOded GoldreichShafi Goldwasser OriginalPaper Pages: 319 - 354
The complexity of computing maximal word functions Eric AllenderDanilo BruschiGiovanni Pighizzini OriginalPaper Pages: 368 - 391
Two tapes versus one for off-line Turing machines Wolfgang MaassGeorg SchnitgerGyörgy Turán OriginalPaper Pages: 392 - 401