Taking it to the limit: on infinite variants of NP-complete problems
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 292-304
- https://doi.org/10.1109/sct.1993.336518
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Logical Definability of NP Optimization ProblemsInformation and Computation, 1994
- Quantifiers and approximationTheoretical Computer Science, 1993
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Hamiltonian paths in infinite graphsIsrael Journal of Mathematics, 1991
- On the complexity of finding the chromatic number of a recursive graph I: the bounded caseAnnals of Pure and Applied Logic, 1989
- A structural overview of NP optimization problemsLecture Notes in Computer Science, 1989
- Optimization problems and the polynomial hierarchyTheoretical Computer Science, 1981
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972