1. The Boolean formula value problem is in ALOGTIME;Buss;Proc. 19th Ann. ACM Symp. on Theory of Computing,1987
2. Polynomial size proofs of the propositional pigeonhole principle;Buss;J. Symbolic Logic,1987
3. Weak formal systems and connections to computational complexity;Buss;Student-written Lecture Notes for a Topics Course at U.C. Berkeley,1988
4. Feasibly constructive proofs and the propositional calculus;Cook;Proc. 7th Ann. ACM Symp. on Theory of Computing,1975