On search decision and the efficiency of polynomial-time algorithms
Michael R. Fellows, Michael Allen Langston · 1989
Recent advances in well-partial-order theory, especially the seminal contributions of Robertson and Seymour, have troubling consequences for those who would equate tractability with polynomial-time decidability. Specifically: