An improved time-space lower bound for tautologies

Scott Diehl, Dieter van Melkebeek, Ryan Williams
2010 Journal of combinatorial optimization  
We show that for all reals c and d such that c 2 d < 4 there exists a positive real e such that tautologies of length n cannot be decided by both a nondeterministic algorithm that runs in time n c , and a nondeterministic algorithm that runs in time n d and space n e . In particular, for every d < 3 √ 4 there exists a positive e such that tautologies cannot be decided by a nondeterministic algorithm that runs in time n d and space n e .
doi:10.1007/s10878-009-9286-x fatcat:a5uvcnupdfahblwqqexbxeitve