Abstract
In this paper we introduce a complexity theoretic notion of counting problems over the real numbers. We follow the approaches of Blum, Shub, and Smale
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Allgower, E.L., Georg, K.: Continuation and Path Following. Acta Numerica. (1992) 1–64
Benedetti, R., Risler, J.J.: Real algebraic and semi-algebraic sets. Hermann (1990)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer-Verlag (to appear)
Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin American Mathematical Society 21 (1989) 1–46
Compton, K.J., Grädel, E.: Logical Definability of Counting Functions Proceedings of IEEE Conference on Structure in Complexity Theory (1994) 255–266
Cucker, F.:, Meer, K.: Logics which capture complexity classes over the reals. Extended abstract to appear in: Proc. 11th International Symposium on Fundamentals of Computation Theory Krakow, Lecture Notes in Computer Science, Springer 1997
Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer-Verlag (1995)
Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. SIAM-AMS Proc. 7 (1974) 43–73
Grädel, E., Meer, K.: Descriptive complexity theory over the real numbers. In J. Renegar, M. Shub, and S. Smale (editors): The Mathematics of Numerical Analysis, Lectures in Applied Mathematics 32, American Mathematical Society (1996) 381–404
Heintz, J., Roy, M.F., Solerno, P.: On the complexity of semialgebraic sets. Proceedings IFIP 1989, San Francisco, North-Holland (1989) 293–298
Heintz, J., Krick, T., Roy, M.F., Solerno, P.: Geometric Problems solvable in single exponential time. In: Proc. 8th Conference AAECC, LNCS 508 (1990) 11–23
Meer, K., Michaux, C.: A survey on real structural complexity theory. Bulletin of the Belgian Math. Soc. Simon Stevin 4 (1997) 113–148
Pedersen, P.: Multivariate Sturm theory. In: Proc. 9th Conference AAECC, LNCS 539 (1991) 318–331
Renegar, J.: On the computational Complexity and Geometry of the first-order Theory of the Reals, I-III. Journal of Symbolic Computation 13 (1992) 255–352
Saluja, S., Subrahmanyam, K.V., Thakur, M.N.: Descriptive Complexity of #P Functions. In Proc. 7th IEEE Symposium on Structure in Complexity Theory (1992) 169–184
Shub, M., Smale, S.: Complexity of Bezout's Theorem I: Geometric aspects. Journal of the AMS 6 (1993) 459–501
Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science 8 (1979) 189–201
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meer, K. (1997). Counting problems over the reals. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029983
Download citation
DOI: https://doi.org/10.1007/BFb0029983
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive