R. Reckhow

Corrections for "On the lengths of proofs in the propositional calculus preliminary version"

Stephen Cook, Robert Reckhow, S. Cook, 1974, SIGA.

Time Bounded Random Access Machines

Stephen A. Cook, Robert A. Reckhow, S. Cook, 1973, J. Comput. Syst. Sci..

On the lengths of proofs in the propositional calculus (Preliminary Version)

S. Cook, R. Reckhow, 1974, STOC '74.

The Relative Efficiency of Propositional Proof Systems

Stephen A. Cook, Robert A. Reckhow, S. Cook, 1979, Journal of Symbolic Logic.

Covering polygons is hard

Joseph C. Culberson, Robert A. Reckhow, J. Culberson, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

Time-bounded random access machines

Stephen A. Cook, Robert A. Reckhow, S. Cook, 1972, J. Comput. Syst. Sci..