On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions

  • César L. Alonso
  • Josè L. Montaña
  • Luis M. Pardo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3618)


Semi-algebraic objects are subsets or functions that can be described by finite boolean combinations of polynomials with real coefficients. In this paper we provide sharp estimates for the the precision and the number of trials needed in the MonteCarlo integration method to achieve a given error with a fixed confidence when approximating the mean value of semi-algebraic functions. Our study extends to the functional case the results of P. Koiran ([7]) for approximating the volume of semi-algebraic sets.


MonteCarlo algorithms discrepancy bounds learning theory Chebyshev inequalities semi-algebraic geometry 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Castro, D., Montaña, J.L., Pardo, L.M., San Martin, J.: The Distribution of Condition Numbers of Rational Data of Bounded Bit Length. Found. of Comput. Math. 1(1), 1–52 (2002)Google Scholar
  2. 2.
    Castro, D., Pardo, L.M., San Martín, J.: Systems of rational polynomial equations have polynomial size approximate zeros on the average. J. Complexity 19(2), 161–209 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Cucker, F., Smale, S.: On the Mathematical foundations of learning. Bulletin (New Series) Of the AMS 39(1), 1–4 (2001)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Davenport, H.: On a Principle of Lipschitz. J. London Math. Soc. 26, 179–183 (1951)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Erdos, P., Turan, P.: On a Problem in the Theory of Uniform Distribution. I, Indagationes Math. 10, 370–378, 57 (1948)Google Scholar
  6. 6.
    Erdos, P., Turan, P.: On a Problem in the Theory of Uniform Distribution. II, Indagationes Math. 10, 406–413 (1948)Google Scholar
  7. 7.
    Koiran, P.: Approximating the volume of definable sets. In: Proc. 36th IEEE Symposyum on Foundations of Computer Science FOCS 1995, pp. 134–141 (1995)Google Scholar
  8. 8.
    Milnor, J.: On the Betti Numbers of Real Varieties. Proc. Amer. Math. Soc. 15, 275–280 (1964)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Montaña, J.L., Pardo, L.M.: Lower bounds for Arithmetic Networks. Applicable Algebra in Engineering Communications and Computing 4, 1–24 (1993)zbMATHCrossRefGoogle Scholar
  10. 10.
    Mordell, L.J.: On some Arithmetical Results in the Geometry of Numbers. Compositio Mathematica 1, 248–253 (1934)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Oleinik, O.A.: Estimates of the Betti Numbers of Real Algebraic Hypersurfaces. Mat. Sbornik 70, 635–640 (1951)MathSciNetGoogle Scholar
  12. 12.
    Oleinik, O.A., Petrovsky, I.B.: On the topology of Real Algebraic Surfaces. Izv. Akad. Nauk SSSR (in Trans. of the Amer. Math. Soc.) 1, 399–417 (1962)Google Scholar
  13. 13.
    Pardo, L.M.: How Lower and Upper Complexity Bounds Meet in Elimination Theory. In: Cohen, G., Giusti, M., Mora, T. (eds.) AAECC 1995. LNCS, vol. 948, pp. 33–69. Springer, Heidelberg (1995)Google Scholar
  14. 14.
    Pollard, P.: Convergence of Stocastic Processes. Springer, Heidelberg (1984)Google Scholar
  15. 15.
    Tarski, A.: A Decision Method for Elementary Algebra and Geometry, RAND Corporation, Santa Monica, Calif. (1948)Google Scholar
  16. 16.
    Thom, R.: Sur l’Homologie des Varietes Alg’ebriques Réeelles. In: Differential and Combinatorial Topology (A Symposium in Honor of Marston Morse), pp. 255–265. Princeton Univ. Press, Princeton (1965)Google Scholar
  17. 17.
    Valiant, L.G.: A theory of the learneable. Communications of the ACM 27, 1134–1142 (1984)zbMATHCrossRefGoogle Scholar
  18. 18.
    Vapnik, V.: Statistical learning theory. John Wiley & Sons, Chichester (1998)zbMATHGoogle Scholar
  19. 19.
    Warren, H.E.: Lower Bounds for Approximation by non Linear Manifolds. Trans. A.M.S. 133, 167–178 (1968)zbMATHMathSciNetCrossRefGoogle Scholar
  20. 20.
    Weinzierl, S.: Introduction to MonteCarlo methods. Technical Report NIKHEF-00-012 Theory Group (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • César L. Alonso
    • 1
  • Josè L. Montaña
    • 2
  • Luis M. Pardo
    • 2
  1. 1.Centro de Inteligencia ArtificialUniversidad de OviedoGijónSpain
  2. 2.Departamento de Matemáticas, Estadística y Computación, Facultad de CienciasUniversidad de CantabriaSpain

Personalised recommendations