Abstract
We define new complexity classes in the Blum–Shub–Smale theory of computation over the reals, in the spirit of the polynomial hierarchy, with the help of infinitesimal and generic quantifiers. Basic topological properties of semialgebraic sets like boundedness, closedness, compactness, as well as the continuity of semialgebraic functions are shown to be complete in these new classes. All attempts to classify the complexity of these problems in terms of the previously studied complexity classes have failed. We also obtain completeness results in the Turing model for the corresponding discrete problems. In this setting, it turns out that infinitesimal and generic quantifiers can be eliminated, so that the relevant complexity classes can be described in terms of the usual quantifiers only.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Allender, P. Bürgisser, J. Kjeldgaard-Pedersen, and P. Bro Miltersen, On the complexity of numerical analysis. in: Proc. 21st Ann. IEEE Conference on Computational Complexity, pp. 331–339, 2006
E. Artin and O. Schreier, Algebraische Konstruktion reeller Körper, Abh. Math. Sem. Univ. Hamburg 5 (1927), 85–99.
S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, Vol. 10, Springer, Berlin, 2003.
G. A. Bliss, Algebraic Functions, Dover, New York, 1966.
L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer, New York, 1998.
L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers, Bull. Am. Math. Soc. 21 (1989), 1–46.
J. Bochnak, M. Coste, and M. F. Roy, Géometrie algébrique réelle, Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge, Vol. 12, Springer, Berlin, 1987.
O. Bournez, F. Cucker, P. Jacobé de Naurois, and J.-Y. Marion, Implicit complexity over an arbitrary structure; Sequential and parallel polynomial time, J. Log. Comput. 15 (2005), 41–58.
E. Brieskorn and H. Knörrer, Plane Algebraic Curves, Birkhäuser, Basel, 1986. Translated from the German by John Stillwell.
P. Bürgisser, Completeness and Reduction in Algebraic Complexity Theory, Algorithms and Computation in Mathematics, Vol. 7, Springer, Berlin, 2000.
P. Bürgisser and F. Cucker, Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets, J. Complex. 22(2) (2006), 147–191.
P. Bürgisser and F. Cucker, Counting complexity classes for numeric computations I: Semilinear sets, SIAM J. Comput. 33 (2004), 227–260.
P. Bürgisser, F. Cucker, and P. J. de Naurois, The complexity of semilinear problems in succinct representation, Comput. Complex. 15 (2006), 197–235.
F. Cucker, PR≠NCR, J. Complex. 8 (1992), 230–238.
F. Cucker, On the complexity of quantifier elimination: The structural approach, Comput. J. 36 (1993), 399–408.
F. Cucker and D. Y. Grigoriev, On the power of real Turing machines over binary inputs, SIAM J. Comput. 26 (1997), 243–254.
F. Cucker and P. Koiran, Computing over the reals with addition and order: Higher complexity classes, J. Complex. 11 (1995), 358–376.
F. Cucker and M. Matamala, On digital nondeterminism, Math. Syst. Theory 29 (1996), 635–647.
F. Cucker and K. Meer, Logics which capture complexity classes over the reals, J. Symb. Log. 64 (1999), 363–390.
F. Cucker and F. Rosselló, On the complexity of some problems for the Blum, Shub & Smale model, in: LATIN’92, Lecture Notes in Computer Science, Vol. 583, pp. 117–129, Springer, Berlin, 1992.
F. Cucker and M. Shub, Generalized knapsack problems and fixed degree separations, Theor. Comput. Sci. 161 (1996), 301–306.
F. Cucker and A. Torrecillas, Two P-complete problems in the theory of the reals, J. Complex. 8 (1992), 454–466.
E. Grädel and K. Meer, Descriptive complexity theory over the real numbers, in: J. Renegar, M. Shub, S. Smale, editors, The Mathematics of Numerical Analysis, Lectures in Applied Mathematics, Vol. 32, pp. 381–404, Amer. Math. Soc., Providence, 1996.
R. Hartshorne, Algebraic Geometry, Graduate Texts in Mathematics, Vol. 52, Springer, New York, 1977.
R. Impagliazzo and B. Kabanets, Derandomizing polynomial identity tests means proving circuit lower bounds, Comput. Complex. 13 (2004), 1–46.
S. C. Kleene, Recursive predicates and quantifiers, Trans. Am. Math. Soc. 53 (1943), 41–73.
P. Koiran, Computing over the reals with addition and order, Theor. Comput. Sci. 133 (1994), 35–47.
P. Koiran, A weak version of the Blum, Shub & Smale model, J. Comput. Syst. Sci. 54 (1997), 177–189.
P. Koiran, The real dimension problem is \(\mathsf{NP}_{\mathbb{R}}\) -complete, J. Complex. 15(2) (1999), 227–238.
M. Mignotte, Mathematics for Computer Algebra, Springer, New York, 1992.
J. Renegar, On the computational complexity and geometry of the first-order theory of the reals, Parts I, II, III, J. Symb. Comput. 13(3) (1992), 255–352.
L. Stockmeyer, The polynomial-time hierarchy, Theor. Comput. Sci. 3 (1977), 1–22.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Mike Shub.
Rights and permissions
About this article
Cite this article
Bürgisser, P., Cucker, F. Exotic Quantifiers, Complexity Classes, and Complete Problems. Found Comput Math 9, 135–170 (2009). https://doi.org/10.1007/s10208-007-9006-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10208-007-9006-9