Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact

Theoretical Computer Science

Volumn 250, Issue 1-2, 2001, Pages 265-332

  Labhalla, S ^a   Lombardi, H ^b   Moutai, E ^a  

^a Institut national des sciences de l'archéologie et du patrimoine Rabat   (Morocco)

^b UNIVERSITÉ DE FRANCHE COMTÉ   (France)

Author keywords

Algorithmic complexity; Arithmetic circuit; Binary semi linear circuit; Boolean circuit; Chebyshev series; Gevrey class; Metric spaces; Real functions; Turing machine; Weierstrass approximation theorem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTABILITY AND DECIDABILITY; POLYNOMIALS; THEOREM PROVING;

WEIERSTRASS APPROXIMATION THEOREM;

COMPUTATIONAL COMPLEXITY;

EID: 9444223911     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(99)00139-5     Document Type: Article

References (34)

1. O. Aberth, Computable Analysis, McGraw-Hill, New York, 1980.
2. Bakhvalov, Méthodes Numériques, Editions MIR, Moscow, 1973.
3. M. Beeson, Foundations of Constructive Mathematics, Springer, Berlin, 1985.
4. E. Bishop, Foundations of Constructive Analysis, McGraw-Hill, New York, 1967.
5. E. Bishop, D. Bridges, Constructive Analysis, Springer, Berlin, 1985.
6. A. Borodin, On relating time et space to size et depth, SIAM J. Comput. 6 (4) (1977) 733-744.
7. R. Brent, Fast multiple-precision evaluation of elementary functions, J. ACM 23 (2) (1976) 242-251.
8. D. Bridges, Constructive Functional Analysis, Pitman, London, 1979.
9. D. Bridges, F. Richman, Varieties of Constructive Mathematics, London Math. Soc. LNS. 97, Cambridge University Press, Cambridge, 1987.
10. E.W. Cheney, Introduction to Approximation Theory, McGraw-Hill, New York, 1966.
11. R. Goodstein, Recursive Analysis, North-Holland, Amsterdam, 1961.
12. J. Hoover, Feasibly constructive analysis, Ph.D. Thesis, 1987.
13. J. Hoover, Feasible real fonctions et arithmetic circuits, SIAM J. Comput. 19 (1) (1990) 182-204.
14. Hörmander, The Analysis of Linear Partial I Differential Operators, Springer, Berlin, 1983.
15. Ker-I. KO, H. Friedman, Computational complexity of real fonctions, Theoret. Comput. Sci. 20 (1982) 323-352.
16. Ker-I. KO, H. Friedman, Computing power series in polynomial time, Adv. Appl. Math. 9 (1988) 40-50.
17. Ker I. KO, On the definitions of some complexity classes of real numbers, Math System Theory 16 (1983) 95-109.
18. Ker I. Ko, Complexity Theory of Real Functions, Birkaüser, Baser, 1991.
19. B.A. Kushner, Lectures on Constructive Mathematical Analysis, AMS Translations of Mathematical Monographs, Vol. 60, 1984 (la version russe est de 1973).
20. S. Labhalla, H. Lombardi, Real numbers, continued fractions, et complexity classes, Ann. Pure Appl. Logic 50 (1990) 1-28.
21. H. Lombardi, Nombres algébriques et approximations, Publications Mathématiques de l'Université (Besançon) Théorie des Nombres. Fascicule 2, 1989.
22. H. Lombardi, Complexité des nombres réels et des fonctions réelles, CALSYF 90, journées du GRLCO de Calcul Formel, 1990.
23. M. Margenstern, L'école constructive de Markov, Revue d'Histoire des Mathématiques 1 (2) (1995) 271-305.
24. R. Mines, F. Richman, W. Ruitenburg, A Course in Constructive Algebra, Springer-Verlag, Universitext, 1988.
25. L.M. Moulai, Complexité des fonctions réelles, comparaison de différentes présentations, Thèse de Troisième Cycle, Marrakech, 1995.
26. N.Th. Müller, Subpolynomial complexity classes of real functions et real numbers, Proc. 13th ICALP, Lecture Notes in Computer Science, vol. 226, Springer, Berlin, 226, 1986, pp. 284-293.
27. N.Th. Müller, Uniform Computational Complexity Classes of Taylor Series, Lecture Notes in Computer Science, Vol. 267, Springer, Berlin, 1987.
28. D.J. Newman, Rational approximation to |x| , Michigan Math. J. (1964).
29. V. Pan, Solving a polynomial equation: some history et recent progress, SIAM Review (1996), àparaître dans.
30. P.P. Petrushev, V. A. Popov, Rational approximation of real functions, Encyclopedia of Mathematics et its applications, Cambridge University Press, Cambridge, 1987.
31. M. Pour El, I. Richards, Computability in Analysis et Physics, Perspectives in Mathematical Logic, Springer, Berlin, 1989.
32. Th.J. Rivlin, The Chebyshev Polynomials, A Wiley Interscience Publication, Wiley & Sons, New York, 1974.
33. C.P. Schnorr, Satisfiability is quasilinear complete in NQL, J. Assoc. Comput. Machinery 25 (1) (1978) 136-145.
34. J. Stern, Fondements mathématiques de l'informatique, McGraw-Hill, Paris, 1990.