Approximation Schemes for First-Order Definable Optimisation Problems
- 22 September 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Preservation Under Extensions on Well-Behaved Finite StructuresLecture Notes in Computer Science, 2005
- An existential locality theoremAnnals of Pure and Applied Logic, 2004
- Shrinking games and local formulasAnnals of Pure and Applied Logic, 2004
- Local Tree-Width, Excluded Minors, and Approximation AlgorithmsCombinatorica, 2003
- Towards a syntactic characterization of PTASPublished by Association for Computing Machinery (ACM) ,1996
- Approximation Properties of NP Minimization ClassesJournal of Computer and System Sciences, 1995
- Logical Definability of NP Optimization ProblemsInformation and Computation, 1994
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- On Local and Non-Local PropertiesPublished by Elsevier BV ,1982
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976