Lower bounds on the complexity of recognizing SAT by Turing machines (2001)

by R Santhanam
Venue:Information Processing Letters 79(5):243–247