On search, decision, and the efficiency of polynomial-time algorithms
- 31 December 1994
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 49 (3) , 769-779
- https://doi.org/10.1016/s0022-0000(05)80079-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Dense layouts for series-parallel circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI DesignSIAM Journal on Discrete Mathematics, 1992
- Finding approximate separators and computing tree width quicklyPublished by Association for Computing Machinery (ACM) ,1992
- Graph minors. IV. Tree-width and well-quasi-orderingJournal of Combinatorial Theory, Series B, 1990
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- Exact and Approximate Solutions for the Gate Matrix Layout ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- The metamathematics of the graph minor theoremContemporary Mathematics, 1987
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- Theorie der Normalflächen: Ein Isotopiekriterium für den KreisknotenActa Mathematica, 1961