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

Authors:
Stephen Cook;Robert Reckhow
Affiliations:
-;-
Venue:
ACM SIGACT News
Year:
1974

Citing 0
Cited 2

Typical case complexity of satisfiability algorithms and the threshold phenomenon

Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract