Abstract
We study real number complexity classes under a logical point of view. Following the approaches by Blum, Shub, and Smale [3] for computability and by Grädel and Meer [10] for descriptive complexity theory over the reals, we characterize such complexity classes by purely logical means. Among them we mainly find parallel classes which have not been studied in [10].
This work has been partially supported by the ESPRIT BRA Program of the EC under contract no. 8556, NeuroCOLT.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I and II. EATCS Monographs on Theoretical Computer Science, 11 and 22. Springer-Verlag, 1988, 1990.
L. Blum, F. Cuclcer, M. Shub, and S. Smale. Complexity and Real Computation. Springer Verlag, to appear.
L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the Amer. Math. Soc., 21:1–46, 1989.
A. Borodin. On relating time and space to size and depth. SIAM Journal on Computing, 6:733–744, 1977.
F. Cucker. P≠R ≠ NC≠R. Journal of Complexity, 8:230–238, 1992.
F. Cucker and M. Matamala. On digital nondeterminism. To appear in Mathematical Systems Theory.
F. Cucker and A. Torrecillas. Two P-complete problems in the theory of the reals. Journal of Complexity, 8:454–466, 1992.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. SIAM-AMS Proc., 7:43–73, 1974.
E. Grädel and Y. Gurevich. Metafinite model theory. In: D. Leivant (ed.), Logic and Computational Complexity, pages 313–366, Springer 1996
E. Grädel and K. Meer. Descriptive complexity theory over the real numbers. In J. Renegar, M. Shub, and S. Smale, editors, The Mathematics of Numerical Analysis, volume 32 of Lectures in Applied Mathematics, pages 381–404. American Mathematical Society, 1996. A preliminary version appeared at STOC'95.
N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.
N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16:760–778, 1987.
K. Meer. On the complexity of quadratic programming in real number models of computation. Theoretical Computer Science, 133:85–94, 1994.
K. Meer and C. Michaux. A survey on real structural complexity theory. In Bulletin of the Belgian Math. Soc., 4:113–148, 1997.
C. Michaux. Une remarque à propos des machines sur R introduites par Blum, Shub et Smale. C. R. Acad. Sci. Paris, 309, Série 1:435–437, 1989.
J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Part II. Journal of Symbolic Computation, 13:301–327, 1992.
M. Vardi. Complexity of relational query languages. In 14th annual ACM Symp. on the Theory of Computing, pages 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cucker, F., Meer, K. (1997). Logics which capture complexity classes over the reals. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036180
Download citation
DOI: https://doi.org/10.1007/BFb0036180
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63386-0
Online ISBN: 978-3-540-69529-5
eBook Packages: Springer Book Archive