Exotic Quantifiers, Complexity Classes, and Complete Problems

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 usual quantifiers only.

[1]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[2]  Felipe Cucker,et al.  Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time , 2005, J. Log. Comput..

[3]  S. Kleene.  Recursive predicates and quantifiers , 1943 .

[4]  Felipe Cucker,et al.  On the Complexity of Some Problems for the Blum, Shub & Smale Model , 1992, LATIN.

[5]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[6]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[7]  Pascal Koiran.  A Weak Version of the Blum, Shub, and Smale Model , 1997, J. Comput. Syst. Sci..

[8]  Felipe Cucker,et al.  Generalized Knapsack Problems and Fixed Degree Separations , 1996, Theor. Comput. Sci..

[9]  Pascal Koiran.  Computing over the Reals with Addition and Order , 1994, Theor. Comput. Sci..

[10]  Felipe Cucker,et al.  Counting Complexity Classes for Numeric Computations I: Semilinear Sets , 2003, SIAM J. Comput..

[11]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[12]  G. Bliss.  Algebraic functions , 1933 .

[13]  Felipe Cucker,et al.  Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets , 2006, J. Complex..

[14]  Pascal Koiran,et al.  The Real Dimension Problem Is NPR-Complete , 1999, J. Complex..

[15]  Felipe Cucker.  On the Complexity of Quantifier Elimination: the Structural Approach , 1993, Comput. J..

[16]  Peter Bro Miltersen,et al.  2 The Task of a Numerical Analyst , 2022 .

[17]  Felipe Cucker,et al.  Computing over the Reals with Addition and Order: Higher Complexity Classes , 1995, J. Complex..

[18]  Klaus Meer,et al.  Logics which capture complexity classes over the reals , 1999 .

[19]  Felipe Cucker,et al.  The complexity of semilinear problems in succinct representation , 2005, computational complexity.

[20]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[21]  Klaus Meer,et al.  Descriptive complexity theory over the real numbers , 1995, STOC '95.

[22]  Felipe Cucker,et al.  Two P-complete problems in the theory of the reals , 1992, J. Complex..

[23]  Felipe Cucker,et al.  Pr != Ncr , 1992, Journal of Complexity.

[24]  Dima Grigoriev,et al.  On the Power of Real Turing Machines Over Binary Inputs , 1997, SIAM J. Comput..