Robert A. Reckhow

Publication Activity (10 Years)

Years Active: 1972-1994
Publications (10 Years): 0

Publications

Joseph C. Culberson, Robert A. Reckhow
Covering Polygons Is Hard. J. Algorithms 17 (1) (1994)
Joseph C. Culberson, Robert A. Reckhow
Orthogonally Convex Coverings of Orthogonal Polygons without Holes. J. Comput. Syst. Sci. 39 (2) (1989)
Joseph C. Culberson, Robert A. Reckhow
Covering Polygons Is Hard (Preliminary Abstract) FOCS (1988)
Robert A. Reckhow, Joseph C. Culberson
Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. SCG (1987)
Stephen A. Cook, Robert A. Reckhow
The Relative Efficiency of Propositional Proof Systems. J. Symb. Log. 44 (1) (1979)
Stephen A. Cook, Robert A. Reckhow
On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) STOC (1974)
Stephen A. Cook, Robert A. Reckhow
Corrections for "On the lengths of proofs in the propositional calculus preliminary version". SIGACT News 6 (3) (1974)
Stephen A. Cook, Robert A. Reckhow
Time Bounded Random Access Machines. J. Comput. Syst. Sci. 7 (4) (1973)
Stephen A. Cook, Robert A. Reckhow
Time-Bounded Random Access Machines STOC (1972)