A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Alternation Trading Proofs and Their Limitations
[chapter]

2013
*
Lecture Notes in Computer Science
*

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 o(1) space, alternation trading proofs can show that deterministic algorithms for Satisfiability require time greater than n cn for c < 2 cos(π/7) (as shown by Williams [21, 19] ), and that

doi:10.1007/978-3-642-40313-2_1
fatcat:ax6jhreugbhr3otle5s64l2gou