Robert A. Reckhow

According to our database, Robert A. Reckhow authored at least 9 papers between 1973 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

The Relative Efficiency of Propositional Proof Systems.

Stephen A. Cook, Robert A. Reckhow

Proceedings of the Logic, 2023

1994

Covering Polygons Is Hard.

Joseph C. Culberson, Robert A. Reckhow

J. Algorithms, 1994

1989

Orthogonally Convex Coverings of Orthogonal Polygons without Holes.

Joseph C. Culberson, Robert A. Reckhow

J. Comput. Syst. Sci., 1989

1988

Covering Polygons Is Hard (Preliminary Abstract)

Joseph C. Culberson, Robert A. Reckhow

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons.

Robert A. Reckhow, Joseph C. Culberson

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1979

The Relative Efficiency of Propositional Proof Systems.

Stephen A. Cook, Robert A. Reckhow

J. Symb. Log., 1979

1974

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

Stephen A. Cook, Robert A. Reckhow

SIGACT News, 1974

On the Lengths of Proofs in the Propositional Calculus (Preliminary Version)

Stephen A. Cook, Robert A. Reckhow

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1973

Time Bounded Random Access Machines.

Stephen A. Cook, Robert A. Reckhow

J. Comput. Syst. Sci., 1973