{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T05:19:44Z","timestamp":1712294384067},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T00:00:00Z","timestamp":1190678400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s10208-007-9006-9","type":"journal-article","created":{"date-parts":[[2007,9,23]],"date-time":"2007-09-23T23:53:53Z","timestamp":1190591633000},"page":"135-170","source":"Crossref","is-referenced-by-count":14,"title":["Exotic Quantifiers, Complexity Classes, and Complete Problems"],"prefix":"10.1007","volume":"9","author":[{"given":"Peter","family":"B\u00fcrgisser","sequence":"first","affiliation":[]},{"given":"Felipe","family":"Cucker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,25]]},"reference":[{"key":"9006_CR1","unstructured":"E. Allender, P. B\u00fcrgisser, J. Kjeldgaard-Pedersen, and P. Bro Miltersen, On the complexity of numerical analysis. in: Proc. 21st Ann. IEEE Conference on Computational Complexity, pp. 331\u2013339, 2006"},{"key":"9006_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02952512","volume":"5","author":"E. Artin","year":"1927","unstructured":"E. Artin and O. Schreier, Algebraische Konstruktion reeller K\u00f6rper, Abh. Math. Sem. Univ. Hamburg 5 (1927), 85\u201399.","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"9006_CR3","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05355-3","volume-title":"Algorithms in Real Algebraic Geometry","author":"S. Basu","year":"2003","unstructured":"S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, Vol. 10, Springer, Berlin, 2003."},{"key":"9006_CR4","volume-title":"Algebraic Functions","author":"G. A. Bliss","year":"1966","unstructured":"G. A. Bliss, Algebraic Functions, Dover, New York, 1966."},{"key":"9006_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1998","unstructured":"L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer, New York, 1998."},{"key":"9006_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"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\u201346.","journal-title":"Bull. Am. Math. Soc."},{"key":"9006_CR7","series-title":"Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge","volume-title":"G\u00e9ometrie alg\u00e9brique r\u00e9elle","author":"J. Bochnak","year":"1987","unstructured":"J. Bochnak, M. Coste, and M. F. Roy, G\u00e9ometrie alg\u00e9brique r\u00e9elle, Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge, Vol. 12, Springer, Berlin, 1987."},{"key":"9006_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/logcom\/exh036","volume":"15","author":"O. Bournez","year":"2005","unstructured":"O. Bournez, F. Cucker, P. Jacob\u00e9 de Naurois, and J.-Y. Marion, Implicit complexity over an arbitrary structure; Sequential and parallel polynomial time, J. Log. Comput. 15 (2005), 41\u201358.","journal-title":"J. Log. Comput."},{"key":"9006_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-5097-1","volume-title":"Plane Algebraic Curves","author":"E. Brieskorn","year":"1986","unstructured":"E. Brieskorn and H. Kn\u00f6rrer, Plane Algebraic Curves, Birkh\u00e4user, Basel, 1986. Translated from the German by John Stillwell."},{"key":"9006_CR10","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04179-6","volume-title":"Completeness and Reduction in Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"2000","unstructured":"P. B\u00fcrgisser, Completeness and Reduction in Algebraic Complexity Theory, Algorithms and Computation in Mathematics, Vol. 7, Springer, Berlin, 2000."},{"issue":"2","key":"9006_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.jco.2005.11.001","volume":"22","author":"P. B\u00fcrgisser","year":"2006","unstructured":"P. B\u00fcrgisser and F. Cucker, Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets, J. Complex. 22(2) (2006), 147\u2013191.","journal-title":"J. Complex."},{"key":"9006_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539702415950","volume":"33","author":"P. B\u00fcrgisser","year":"2004","unstructured":"P. B\u00fcrgisser and F. Cucker, Counting complexity classes for numeric computations I: Semilinear sets, SIAM J. Comput. 33 (2004), 227\u2013260.","journal-title":"SIAM J. Comput."},{"key":"9006_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00037-006-0213-6","volume":"15","author":"P. B\u00fcrgisser","year":"2006","unstructured":"P. B\u00fcrgisser, F. Cucker, and P. J. de Naurois, The complexity of semilinear problems in succinct representation, Comput. Complex. 15 (2006), 197\u2013235.","journal-title":"Comput. Complex."},{"key":"9006_CR14","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0885-064X(92)90024-6","volume":"8","author":"F. Cucker","year":"1992","unstructured":"F. Cucker, PR\u2260NCR, J. Complex. 8 (1992), 230\u2013238.","journal-title":"J. Complex."},{"key":"9006_CR15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1093\/comjnl\/36.5.400","volume":"36","author":"F. Cucker","year":"1993","unstructured":"F. Cucker, On the complexity of quantifier elimination: The structural approach, Comput. J. 36 (1993), 399\u2013408.","journal-title":"Comput. J."},{"key":"9006_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1137\/S0097539794270340","volume":"26","author":"F. Cucker","year":"1997","unstructured":"F. Cucker and D. Y. Grigoriev, On the power of real Turing machines over binary inputs, SIAM J. Comput. 26 (1997), 243\u2013254.","journal-title":"SIAM J. Comput."},{"key":"9006_CR17","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jcom.1995.1018","volume":"11","author":"F. Cucker","year":"1995","unstructured":"F. Cucker and P. Koiran, Computing over the reals with addition and order: Higher complexity classes, J. Complex. 11 (1995), 358\u2013376.","journal-title":"J. Complex."},{"key":"9006_CR18","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/BF01301968","volume":"29","author":"F. Cucker","year":"1996","unstructured":"F. Cucker and M. Matamala, On digital nondeterminism, Math. Syst. Theory 29 (1996), 635\u2013647.","journal-title":"Math. Syst. Theory"},{"key":"9006_CR19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/2586770","volume":"64","author":"F. Cucker","year":"1999","unstructured":"F. Cucker and K. Meer, Logics which capture complexity classes over the reals, J. Symb. Log. 64 (1999), 363\u2013390.","journal-title":"J. Symb. Log."},{"key":"9006_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BFb0023823","volume-title":"LATIN\u201992","author":"F. Cucker","year":"1992","unstructured":"F. Cucker and F. Rossell\u00f3, On the complexity of some problems for the Blum, Shub & Smale model, in: LATIN\u201992, Lecture Notes in Computer Science, Vol. 583, pp. 117\u2013129, Springer, Berlin, 1992."},{"key":"9006_CR21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(96)00002-3","volume":"161","author":"F. Cucker","year":"1996","unstructured":"F. Cucker and M. Shub, Generalized knapsack problems and fixed degree separations, Theor. Comput. Sci. 161 (1996), 301\u2013306.","journal-title":"Theor. Comput. Sci."},{"key":"9006_CR22","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/0885-064X(92)90008-Y","volume":"8","author":"F. Cucker","year":"1992","unstructured":"F. Cucker and A. Torrecillas, Two P-complete problems in the theory of the reals, J. Complex. 8 (1992), 454\u2013466.","journal-title":"J. Complex."},{"key":"9006_CR23","series-title":"Lectures in Applied Mathematics","first-page":"381","volume-title":"The Mathematics of Numerical Analysis","author":"E. Gr\u00e4del","year":"1996","unstructured":"E. Gr\u00e4del 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\u2013404, Amer. Math. Soc., Providence, 1996."},{"key":"9006_CR24","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3849-0","volume-title":"Algebraic Geometry","author":"R. Hartshorne","year":"1977","unstructured":"R. Hartshorne, Algebraic Geometry, Graduate Texts in Mathematics, Vol. 52, Springer, New York, 1977."},{"key":"9006_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00037-004-0182-6","volume":"13","author":"R. Impagliazzo","year":"2004","unstructured":"R. Impagliazzo and B. Kabanets, Derandomizing polynomial identity tests means proving circuit lower bounds, Comput. Complex. 13 (2004), 1\u201346.","journal-title":"Comput. Complex."},{"key":"9006_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1090\/S0002-9947-1943-0007371-8","volume":"53","author":"S. C. Kleene","year":"1943","unstructured":"S. C. Kleene, Recursive predicates and quantifiers, Trans. Am. Math. Soc. 53 (1943), 41\u201373.","journal-title":"Trans. Am. Math. Soc."},{"key":"9006_CR27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(93)00063-B","volume":"133","author":"P. Koiran","year":"1994","unstructured":"P. Koiran, Computing over the reals with addition and order, Theor. Comput. Sci. 133 (1994), 35\u201347.","journal-title":"Theor. Comput. Sci."},{"key":"9006_CR28","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jcss.1997.1478","volume":"54","author":"P. Koiran","year":"1997","unstructured":"P. Koiran, A weak version of the Blum, Shub & Smale model, J. Comput. Syst. Sci. 54 (1997), 177\u2013189.","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9006_CR29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1006\/jcom.1999.0502","volume":"15","author":"P. Koiran","year":"1999","unstructured":"P. Koiran, The real dimension problem is $\\mathsf{NP}_{\\mathbb{R}}$ -complete, J. Complex. 15(2) (1999), 227\u2013238.","journal-title":"J. Complex."},{"key":"9006_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9171-5","volume-title":"Mathematics for Computer Algebra","author":"M. Mignotte","year":"1992","unstructured":"M. Mignotte, Mathematics for Computer Algebra, Springer, New York, 1992."},{"issue":"3","key":"9006_CR31","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"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\u2013352.","journal-title":"J. Symb. Comput."},{"key":"9006_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"L. Stockmeyer, The polynomial-time hierarchy, Theor. Comput. Sci. 3 (1977), 1\u201322.","journal-title":"Theor. Comput. Sci."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-007-9006-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-007-9006-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-007-9006-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:05:09Z","timestamp":1559113509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-007-9006-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,25]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9006"],"URL":"https:\/\/doi.org\/10.1007\/s10208-007-9006-9","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,25]]}}}