1. Two theorems on random polynomial time;Adleman,1978
2. Relationship between density and deterministic complexity of NP-complete languages;Berman,1978
3. The complexity of theorem proving procedures;Cook,1971
4. Some approaches to constructive analysis;Grzegorczyk,1959
5. The LBA problem and its importance in the theory of computing;Hartmanis,1974