Quantifiers and approximation
Open Access
- 4 January 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 107 (1) , 145-163
- https://doi.org/10.1016/0304-3975(93)90259-v
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Completeness in approximation classesInformation and Computation, 1991
- The complexity of optimization problemsJournal of Computer and System Sciences, 1988
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Non deterministic polynomial optimization problems and their approximationsTheoretical Computer Science, 1981
- Toward a unified approach for the classification of NP-complete optimization problemsTheoretical Computer Science, 1980
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976