Alternation Trading Proofs and Their Limitations

Abstract

Alternation trading proofs are motivated by the goal of separating NP from complexity classes such as Logspace or NL; they have been used to give super-linear runtime bounds for deterministic and conondeterministic sublinear space algorithms which solve the Satisfiability problem. For algorithms which use n space, alternation trading proofs can show that… (More)
DOI: 10.1007/978-3-642-40313-2_1
View Slides

Topics

  • Presentations referencing similar topics