An improved time-space lower bound for tautologies

@article{Diehl2011AnIT,
  title={An improved time-space lower bound for tautologies},
  author={Scott Diehl and Dieter van Melkebeek and Ryan Williams},
  journal={J. Comb. Optim.},
  year={2011},
  volume={22},
  pages={325-338}
}
We show that for all reals c and d such that cd < 4 there exists a real e > 0 such that tautologies of length n cannot be decided by both a nondeterministic algorithm that runs in time n, and a nondeterministic algorithm that runs in time n and space n. In particular, for all d < 3 √ 4 there exists an e > 0 such that tautologies cannot be decided by a nondeterministic algorithm that runs in time n and space n.