Order · 1987 · 24 citations · 5 references
ComputingComputer ScienceRepresentation TheoryLinear AlgebraRegular LanguagesStructural ComplexityCompletenessCompleteness ResultsLinear ExtensionsNp-complete ProblemsNp-completeness
5
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
A Decomposition Theorem for Partially Ordered Sets
R. P. Dilworth · Annals of Mathematics · 1950 · 987 citations