Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Coauthors
(1)
Stephen Arthur Cook
7
Conferences
(1)
STOC
3
Journals
(3)
JSYML
2
JCSS
1
SIGACT
1
Keywords
(13)
Embed
Subscribe
Academic
Authors
Robert A. Reckhow
Robert A. Reckhow,University of Toronto,Algorithms & Theory,Scientific Computing,Mathematics
Edit
Robert A. Reckhow
University of Toronto
Publications:
7

Citations:
690
Fields:
Algorithms & Theory
,
Scientific Computing
,
Mathematics
View FAQ about top research areas and Fields of study
Collaborated with
1 coauthor
from 1972 to 1979

Cited by
437 authors
Cumulative
Annual
Sort by:
Publications
(7)
BibTeX

RIS

RefWorks
Download
The Relative Efficiency of Propositional Proof Systems
(
Citations: 423
)
Stephen A. Cook
,
Robert A. Reckhow
Journal:
Journal of Symbolic Logic  JSYML
, vol. 44, no. 1, pp. 3650, 1979
The relative complexity of propositional proof systems
(
Citations: 7
)
S. A. Cook
,
R. A. Reckhow
Journal:
Journal of Symbolic Logic  JSYML
, 1979
On the lengths of proofs in the propositional calculus (Preliminary Version)
(
Citations: 35
)
Stephen A. Cook
,
Robert A. Reckhow
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 135148, 1974
On the lenght of proofs in the propositional calculus
(
Citations: 18
)
S. Cook
,
R. Reckhow
Conference:
ACM Symposium on Theory of Computing  STOC
, 1974
Corrections for "On the lengths of proofs in the propositional calculus preliminary version"
(
Citations: 2
)
Stephen Cook
,
Robert Reckhow
Journal:
Sigact News  SIGACT
, vol. 6, no. 3, pp. 1522, 1974
Sort by:
Citations
(690 times by 579 publications)
On theories of bounded arithmetic for NC
(
Citations: 1
)
Emil Jerábek
Journal:
Annals of Pure and Applied Logic  APAL
, vol. 162, no. 4, pp. 322340, 2011
On the power of clauselearning SAT solvers as resolution engines
(
Citations: 1
)
Knot Pipatsrisawat
,
Adnan Darwiche
Journal:
Artificial Intelligence  AI
, vol. 175, no. 2, pp. 512525, 2011
Speedup for natural problems and noncomputability
(
Citations: 1
)
Hunter Monroe
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 45, pp. 478481, 2011
Listings and logics
Yijia Chen
,
Joerg Flum
Conference:
Logic in Computer Science  LICS
, vol. 18, pp. 20174, 2011
Parameterized Proof Complexity
Stefan S. Dantchev
,
Barnaby Martin
,
Stefan Szeider
Journal:
Computational Complexity  CC
, vol. 20, no. 1, pp. 5185, 2011
Comments