Comparing notions of approximation.
- Autores: Mario Furnari, Antonio Massarotti
- Localización: Stochastica: revista de matemática pura y aplicada, ISSN 0210-7821, Vol. 12, Nº. 1, 1988, págs. 19-31
- Idioma: inglés
- Títulos paralelos:
- Comparación de nociones de aproximación.
- Enlaces
-
Resumen
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optimization problems. Then we analyze the Theory of Analytical Computational Complexity to gain some insight about the notions of approximation and approximate algorithms. We stress the different roles played by these notions within the theories of Analytical and Algebraic Complexity. We finally outline a possible strategy to capture a more useful notion of approximation which is inspired by some results on Linear Programming problems.
¿Es nuevo? Regístrese
Ventajas de registrarse
