NP-completeness properties about linear extensions

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.1K citations · Full text

Engineering, Verification, Automated Proof +17

A Decomposition Theorem for Partially Ordered Sets

R. P. Dilworth · Annals of Mathematics · 1950 · 976 citations

Order Theory, Partially Ordered Sets, Extremal Set Theory +3

The Complexity of the Partial Order Dimension Problem

Mihalis Yannakakis · SIAM Journal on Algebraic and Discrete Methods · 1982 · 407 citations

Mathematical Programming, Order Theory, Computational Complexity Theory +14

Minimizing setups for cycle-free ordered sets

Dwight Duffus, Ivan Rival, Peter Winkler · Proceedings of the American Mathematical Society · 1982 · 55 citations · Full text

Mathematical Programming, Engineering, Combinatorial Design +18

Algorithmic Approaches to Setup Minimization

Ulrich Faigle, Gerhard Gierz, Rainer Schräder · SIAM Journal on Computing · 1985 · 16 citations

Mathematical Programming, Large-scale Global Optimization, Engineering +19