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.
@article{urn:eudml:doc:39009,
title = {Comparing notions of approximation.},
journal = {Stochastica},
volume = {12},
year = {1988},
pages = {19-31},
zbl = {0679.68078},
mrnumber = {MR1004656},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39009}
}
Furnari, Mario; Massarotti, Antonio. Comparing notions of approximation.. Stochastica, Tome 12 (1988) pp. 19-31. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39009/