Nonconstructive tools for proving polynomial-time decidability (original) (raw)
Published: 01 June 1988 Publication History
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.
References
[1]
ABELLO, J., FELLOWS, M., AND RICHMAN, F. A Robertson-Seymour poset in the subgroup structure of finite Abelian groups. To appear.
[2]
ANGLUIN, D. Local and global properties in networks of processors. In Proceedings of the 12th ACM Symposium on Theory of Computing. ACM, New York, 1980, pp. 82-93.
[3]
ARKIN, E. Complexity of cycle and path problems in graphs. Ph.D. dissertation. Stanford Univ., Stanford, Calif., 1986.
[4]
ARNBORG, S., CORNEIL, D. G., AND PROSKUROWSKI, A. Complexity of finding embeddings in a k-tree. To appear.
[5]
BAREFOOT, C., ENTRINGER, R., AND SWART, H. Vulnerability in graphs--A comparative study. J. Comb. Math. Comb. Comput. 1 (1987), 13-22.
[6]
BIFNSTOCK, D., AND MONNA, C.L. On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. To appear.
[7]
BONDY, J., AND MURTY, U. Graph Theory with Applications. American Elsevier, New York, 1976.
[8]
BROWN, D. J., FELLOWS, i. R., AND LANGSTON, M.A. Polynomial-time self-reducibility: Theoretical motivations and practical results. Tech. Rep. CS-87-171. Computer Science Dept., Washington State Univ., Pullman, Wash., 1987.
[9]
BRYANT, R. L., FELLOWS, i. R., KINNERSLEY, N. G., AND LANGSTON, i. A. On finding obstruction sets and polynomial-time algorithms for gate matrix layout. In Proceedings of the 25th Allerton Conference on Communication, Control, and Computing (Urbana, Ill., Sept. 30-Oct. 2), 1987, pp. 397-398.
[10]
CLARK, L., ENTRINGER, R., AND FELLOWS, M.R. Computational complexity of integrity. J. Comb. Math. Comb. Comput. To appear.
[11]
CONWAY, J., AND GORDON, C. Knots and links in spatial graphs. J. Graph Theory 7 (1983), 445-453.
[12]
DEO, N., KRISHNAMOORTHY, M. S., AND LANGSTON, M.A. Exact and approximate solutions for the gate matrix layout problem. IEEE Trans. Comput. Aid. Des. CAD 6 (1987), 79-84.
[13]
ELLIS, J., SUDBOROUGH, I. H., AND TURNER, J. Graph separation and search number. To appear.
[14]
FARBER, i., HAHN, G., HELL, P., AND MILLER, D. Concerning the achromatic number of graphs. J. Comb. Theory, Series B 40 (1986), 21-39.
[15]
FELLOWS, i.R. Encoding graphs in gv. iahs. Ph.D. dissertation. Univ. of Calif., San Diego, San Diego, Calif. 1985.
[16]
FELLOWS, M. R., AND LANGSTON, M.A. Nonconstructive advances in polynomial-time complexity. Inf. Process. Lett. 26 (1987), 157-162.
[17]
FELLOWS, M. R., AND LANGSTON, i.A. Layout permutation problems and well-partially-ordered sets. In Proceedings of the 5th NIT Conference on Advanced Research in VLSI (Cambridge, Mass., Mar. 28-30). NIT Press, Cambridge, Mass., 1988, pp. 315-327.
[18]
FELLOWS, i. R., AND LANGSTON, M.A. Fast self-reduction algorithms for combinatorial problems of VLSI Design. In Proceedings of the 3rd International Workshop on Parallel Computation and VLSI Theory (,4 WOC) (Corfu Island, Greece, June 28-July 1), 1988. To appear.
[19]
FELLOWS, M. R., HICKLING, F.~ND SYSLO, M. A topological parameterization and hard graph problems. Congressus Nurneranbiun. ~. _,
[20]
FILOTTI, I. S., MILLER, G. L., AND REIF, J. i, ill determining the genus of a graph in O(V~t*)) steps. In Proceedings of the 1 lth ACM Sympo3,. .n on Theory of Computing (Atlanta, Ga., Apr. 3- May 2). ACM, New York, 1979, pp. 27-37.
[21]
FRIEDMAN, H., ROBERTSON, N., AND SEYMOUR, P.D. The metamathematics of the graph minor theorem. In Applications of Logic to Combinatorics. AMS Contemporary Mathematics Series, American Mathematical Society, Providence, R.I. To appear.
[22]
GAREY, M. R., AND JOHNSON, D.S. Computers and Intractability: A Guide to the Theory of NP- Completeness. Freeman, San Francisco, Calif., 1979.
[23]
HAKEN, W. Theorie der Normalfliichen. Acta Math. 105 (1961), 245-375.
[24]
HELL, P., AND MILLER, D. Graphs with given achromatic number. Discrete Math. 16 (1976), 195-207.
[25]
HOPCROFT, J. E., AND ULLMAN, J.D. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.
[26]
HUNTER, R., RICHMAN, F., AND WALKER, E. Simply presented valuated Abelian p-groups. J. Algebra 49 (1977), 125-133.
[27]
ITAI, A., AND RODEH, M. Finding a minimum circuit in a graph. In Proceedings of the 9th ACM Symposium on Theory of Computing (Boulder, Colo., May 2-4). ACM, New York, 1977, pp. 1-10.
[28]
JOHNSON, D. S. The many faces of polynomial time. In The NP-Completeness Column: An Ongoing Guide. J. Algorithms 8 (1987), 285-303.
[29]
MAKEDON, F. S., PAPADIMITRIOU, C. H., AND SUDBOROUGH, I. H. Topological band width, SIAM J. Algebraic Discrete Methods 6 (1985), 418-444.
[30]
MEGIDDO, N., HAKIMI, S. L., GAREY, M. R., JOHNSON, D. S., AND PAPADIMITRIOU, C.H. On the Complexity of Searching a Graph. IBM Res. Rep. ILl 4987, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., 1986.
[31]
MEYER, A., AND PATERSON, M. With what frequency are apparently intractable problems difficult. Comput. Sci. Dept., Tech. Rep. Massachusetts Institute of Technology, Cambridge, Mass., 1979.
[32]
MILNER, E. Basic WQO and BQO Theory. In Graphs and Orders, I. Rival, Ed. Reidel, Amsterdam, 1985.
[33]
NASH-WILLIAMS, C. On well-quasi-ordering infinite trees. Proc. Cambridge PhiL Soc. 61 (1965), 697-720.
[34]
NESETRm, J., AND THOMAS, R. A note on spatial representation of graphs. Commentat. Math. Univ. Carolinae 26 (1985), 655-659.
[35]
RICHMAN, F. Computers, trees, and Abelian groups. To appear.
[36]
ROBERTSON, N., AND SEYMOUR, P. D. Disjoint paths~A survey. SIAM J. Algebraic Discrete Methods 6 (1985), 300-305.
[37]
ROBERTSON, N., AND SEYMOUR, P.D. Graph minors~A Survey. In Surveys in Combinatorics, I. Anderson, Ed. Cambridge Univ. Press, Cambridge, England, 1985, pp. 153-171.
[38]
ROBERTSON, N., AND SEYMOUR, P.D. Graph minors XIII. The disjoint paths problem. To appear.
[39]
ROBERTSON, N., AND SEYMOUR, P.D. Graph minors XVI. Wagner's conjecture. To appear.
[40]
ROGERS, L. Ulm's theorem for partially ordered structures related to simply presented Abelian p-groups. Trans. Am. Math. Soc. 227 (1977), 333-343.
[41]
SACHS, H. On spatial representations of finite graphs. In Colloquia Mathematica Societatis Janos Bolyai 37, Finite and Infinite Sets. Eger, Budapest, Hungary, 198 I, pp. 649-662.
[42]
SCHUBERT, H. Bestimmung der Primfaktorzerlegung von Verkettungen. Math. Z. 76 (1961), 116-148.
[43]
STILLWELL, J. Classical Topology and Combinatorial Group Theory. Springer-Verlag, New York, 1980.
[44]
THOMAS, R. Graphs without K4 and well-quasi ordering. J. Comb. Theory, Series B 38 (1985), 240-247.
[45]
THOMASSEN, C. Graph families with the Erdrs-Prsa Property. J. Graph Theory. To appear.
[46]
WAGNER, K. Uber Einer Eigenschaft der Ebener Complexe. Math. Ann. 14 (1937), 570-590.
[47]
WELSH, D. J. Matroid Theory. Academic Press, Orlando, Fla., 1976.
[48]
WmF, H. Finite lists of obstructions. Am. Math. Monthly 94 (1987), 267-271.
Information & Contributors
Information
Published In
Journal of the ACM Volume 35, Issue 3
July 1988
280 pages
Copyright © 1988 ACM.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1988
Published in JACM Volume 35, Issue 3
Permissions
Request permissions for this article.
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations
- Downloads (Last 12 months)121
- Downloads (Last 6 weeks)24
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
- Bradford P(2024)The Fibonacci Sequence and the Time Complexity of Generating the Conway Polynomial and Related Topological InvariantsThe Fibonacci Quarterly10.1080/00150517.1990.1242948828:3(240-251)Online publication date: 27-Sep-2024
- Bonfante GDeloup F(2024)The genus of regular languages and directed graph emulatorsTheoretical Computer Science10.1016/j.tcs.2024.1145791000:COnline publication date: 24-Jun-2024
- Sau IStamoulis GThilikos D(2023) k-apices of minor-closed graph classes. I. Bounding the obstructionsJournal of Combinatorial Theory Series B10.1016/j.jctb.2023.02.012161:C(180-227)Online publication date: 1-Jul-2023
- Sahu ASaurabh S(2023)Kernelization of Arc Disjoint Cycle Packing in α-Bounded DigraphsTheory of Computing Systems10.1007/s00224-022-10114-867:2(221-233)Online publication date: 26-Jan-2023
- Boffa AFerragina PVinciguerra G(2022)A Learned Approach to Design Compressed Rank/Select Data StructuresACM Transactions on Algorithms10.1145/352406018:3(1-28)Online publication date: 11-Oct-2022
- Sau IStamoulis GThilikos D(2022)k-apices of Minor-closed Graph Classes. II. Parameterized AlgorithmsACM Transactions on Algorithms10.1145/351902818:3(1-30)Online publication date: 11-Oct-2022
- Abu-Khzam FAbd El-Wahab MHaidous MYosri N(2022)Learning from obstructions: An effective deep learning approach for minimum vertex coverAnnals of Mathematics and Artificial Intelligence10.1007/s10472-022-09813-2Online publication date: 16-Aug-2022
- Bodlaender H(2022)From the W-hierarchy to XNLPWALCOM: Algorithms and Computation10.1007/978-3-030-96731-4_2(15-25)Online publication date: 24-Mar-2022
- Bui NPham NBarnitz JZou ZNguyen PTruong HKim TFarrow NNguyen AXiao JDeterding RDinh TVu T(2021)eBPCommunications of the ACM10.1145/347044664:8(118-125)Online publication date: 26-Jul-2021
- CACM Staff (2021)Tales of two TuringsCommunications of the ACM10.1145/346987664:8(7-9)Online publication date: 26-Jul-2021
- Show More Cited By
View Options
View options
View or Download as a PDF file.
eReader
View online with eReader.
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Full Access
Media
Figures
Other
Tables
Affiliations
Michael R. Fellows
Michael A. Langston
Washington State Univ., Pullman