@article{10.1145/44483.44491,
    Abstract = {Recent advances in graph theory and graph algorithms dramatically alter the traditional view of concrete complexity theory, in which a decision problem is generally shown to be in P by producing an efficient algorithm to solve an optimization version of the problem. Nonconstructive tools are now available for classifying problems as decidable in polynomial time by guaranteeing only the existence of polynomial-time decision algorithms. In this paper these new methods are employed to prove membership in P for a number of problems whose complexities are not otherwise known. Powerful consequences of these techniques are pointed out and their utility is illustrated. A type of partially ordered set that supports this general approach is defined and explored.},
    Address = {New York, NY, USA},
    Author = {Fellows, Michael R. and Langston, Michael A.},
    File = {Nonconstructive Tools for Proving Polynomial-Time Decidability F - L88\_NonconstructiveTools.pdf},
    ISSN = {0004-5411},
    Journal = {J. ACM},
    Month = {June},
    Number = {3},
    Pages = {727--739},
    Publisher = {Association for Computing Machinery},
    Title = {Nonconstructive Tools for Proving Polynomial-Time Decidability},
    URL = {https://doi.org/10.1145/44483.44491},
    Volume = {35},
    Year = {1988},
    bdsk-url-1 = {https://doi.org/10.1145/44483.44491},
    date-added = {2021-07-13 13:07:44 +0200},
    date-modified = {2021-07-13 13:07:44 +0200},
    issue_date = {July 1988},
    numpages = {13},
    doi = {10.1145/44483.44491}
}

@article{10.1145/44483.44491, Abstract = {Recent advances in graph theory and graph algorithms dramatically alter the traditional view of concrete complexity theory, in which a decision problem is generally shown to be in P by producing an efficient algorithm to solve an optimization version of the problem. Nonconstructive tools are now available for classifying problems as decidable in polynomial time by guaranteeing only the existence of polynomial-time decision algorithms. In this paper these new methods are employed to prove membership in P for a number of problems whose complexities are not otherwise known. Powerful consequences of these techniques are pointed out and their utility is illustrated. A type of partially ordered set that supports this general approach is defined and explored.}, Address = {New York, NY, USA}, Author = {Fellows, Michael R. and Langston, Michael A.}, File = {Nonconstructive Tools for Proving Polynomial-Time Decidability F - L88_NonconstructiveTools.pdf}, ISSN = {0004-5411}, Journal = {J. ACM}, Month = {June}, Number = {3}, Pages = {727--739}, Publisher = {Association for Computing Machinery}, Title = {Nonconstructive Tools for Proving Polynomial-Time Decidability}, URL = {https://doi.org/10.1145/44483.44491}, Volume = {35}, Year = {1988}, bdsk-url-1 = {https://doi.org/10.1145/44483.44491}, date-added = {2021-07-13 13:07:44 +0200}, date-modified = {2021-07-13 13:07:44 +0200}, issue_date = {July 1988}, numpages = {13}, doi = {10.1145/44483.44491} }