Iannis Tourlakis Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines. 22- 2000 IEEE Conference on Computational Complexity http://computer.org/proceedings/coco/0674/06740022abs.htm db/conf/coco/coco2000.html#Tourlakis00