{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:48Z","timestamp":1725490428598},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_20","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"207-218","source":"Crossref","is-referenced-by-count":1,"title":["Exotic Quantifiers, Complexity Classes, and Complete Problems"],"prefix":"10.1007","author":[{"given":"Peter","family":"B\u00fcrgisser","sequence":"first","affiliation":[]},{"given":"Felipe","family":"Cucker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"331","volume-title":"Proc. 21st Ann. IEEE Conference on Computational Complexity","author":"E. Allender","year":"2006","unstructured":"Allender, E., B\u00fcrgisser, P., Kjeldgaard-Pedersen, J., Bro-Miltersen, P.: On the complexity of numerical analysis. In: Proc. 21st Ann. IEEE Conference on Computational Complexity, pp. 331\u2013339. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"20_CR2","volume-title":"Algebraic functions","author":"G.A. Bliss","year":"1966","unstructured":"Bliss, G.A.: Algebraic functions. Dover Publications, New York (1966)"},{"key":"20_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1998","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers. Bull.\u00a0Amer. Math. Soc.\u00a021, 1\u201346 (1989)","journal-title":"Bull.\u00a0Amer. Math. Soc."},{"key":"20_CR5","series-title":"Ergebnisse der Mathematik und ihrer Grenzgebiete, 3","volume-title":"G\u00e9ometrie alg\u00e9brique r\u00e9elle","author":"J. Bochnak","year":"1987","unstructured":"Bochnak, J., Coste, M., Roy, M.F.: G\u00e9ometrie alg\u00e9brique r\u00e9elle, Folge. Ergebnisse der Mathematik und ihrer Grenzgebiete, 3, vol.\u00a012. Springer, Heidelberg (1987)"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1093\/logcom\/exh036","volume":"15","author":"O. Bournez","year":"2005","unstructured":"Bournez, O., Cucker, F., de Naurois, P.J., Marion, J.-Y.: Implicit complexity over an arbitrary structure: sequential and parallel polynomial time. J. Logic Comput.\u00a015(1), 41\u201358 (2005)","journal-title":"J. Logic Comput."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539702415950","volume":"33","author":"P. B\u00fcrgisser","year":"2003","unstructured":"B\u00fcrgisser, P., Cucker, F.: Counting complexity classes for numeric computations I: Semilinear sets. SIAM J.\u00a0Comp.\u00a033, 227\u2013260 (2003)","journal-title":"SIAM J.\u00a0Comp."},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.jco.2005.11.001","volume":"22","author":"P. B\u00fcrgisser","year":"2006","unstructured":"B\u00fcrgisser, P., Cucker, F.: Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. Journal of Complexity\u00a022(2), 147\u2013191 (2006)","journal-title":"Journal of Complexity"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00037-006-0213-6","volume":"15","author":"P. B\u00fcrgisser","year":"2006","unstructured":"B\u00fcrgisser, P., Cucker, F., de Naurois, P.J.: The complexity of semilinear sets in succinct representation. Comp. Compl.\u00a015, 197\u2013235 (2006)","journal-title":"Comp. Compl."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0885-064X(92)90024-6","volume":"8","author":"F. Cucker","year":"1992","unstructured":"Cucker, F.: P\n \n R\n \u2009\u2260\u2009NC\n \n R\n . Journal of Complexity\u00a08, 230\u2013238 (1992)","journal-title":"Journal of Complexity"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1093\/comjnl\/36.5.400","volume":"36","author":"F. Cucker","year":"1993","unstructured":"Cucker, F.: On the Complexity of Quantifier Elimination: the Structural Approach. The Computer Journal\u00a036, 399\u2013408 (1993)","journal-title":"The Computer Journal"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1137\/S0097539794270340","volume":"26","author":"F. Cucker","year":"1997","unstructured":"Cucker, F., Yu, D.: On the power of real Turing machines over binary inputs. SIAM J.\u00a0Comp.\u00a026, 243\u2013254 (1997)","journal-title":"SIAM J.\u00a0Comp."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jcom.1995.1018","volume":"11","author":"F. Cucker","year":"1995","unstructured":"Cucker, F., Koiran, P.: Computing over the reals with addition and order: Higher complexity classes. Journal of Complexity\u00a011, 358\u2013376 (1995)","journal-title":"Journal of Complexity"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/2586770","volume":"64","author":"F. Cucker","year":"1999","unstructured":"Cucker, F., Meer, K.: Logics which capture complexity classes over the reals. J. Symbolic Logic\u00a064(1), 363\u2013390 (1999)","journal-title":"J. Symbolic Logic"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BFb0023823","volume-title":"LATIN \u201992","author":"F. Cucker","year":"1992","unstructured":"Cucker, F., Rossell\u00f3, F.: On the complexity of some problems for the Blum, Shub & Smale model. In: Simon, I. (ed.) LATIN 1992. LNCS, vol.\u00a0583, pp. 117\u2013129. Springer, Heidelberg (1992)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0304-3975(96)00002-3","volume":"161","author":"F. Cucker","year":"1996","unstructured":"Cucker, F., Shub, M.: Generalized knapsack problems and fixed degree separations. Theoret. Comp. Sci.\u00a0161, 301\u2013306 (1996)","journal-title":"Theoret. Comp. Sci."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/0885-064X(92)90008-Y","volume":"8","author":"F. Cucker","year":"1992","unstructured":"Cucker, F., Torrecillas, A.: Two p-complete problems in the theory of the reals. Journal of Complexity\u00a08, 454\u2013466 (1992)","journal-title":"Journal of Complexity"},{"key":"20_CR18","series-title":"Lectures in Appl. Math","first-page":"381","volume-title":"The mathematics of numerical analysis","author":"E. Gr\u00e4del","year":"1996","unstructured":"Gr\u00e4del, E., Meer, K.: Descriptive complexity theory over the real numbers. In: Gr\u00e4del, E., Meer, K. (eds.) The mathematics of numerical analysis, Park City, UT. Lectures in Appl. Math, vol.\u00a032, pp. 381\u2013403. Amer. Math. Soc, Providence, RI (1996)"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/1990131","volume":"53","author":"S.C. Kleene","year":"1943","unstructured":"Kleene, S.C.: Recursive predicates and quantifiers. Trans. Amer. Math. Soc.\u00a053, 41\u201373 (1943)","journal-title":"Trans. Amer. Math. Soc."},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(93)00063-B","volume":"133","author":"P. Koiran","year":"1994","unstructured":"Koiran, P.: Computing over the reals with addition and order. Theoret. Comp. Sci.\u00a0133, 35\u201347 (1994)","journal-title":"Theoret. Comp. Sci."},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jcss.1997.1478","volume":"54","author":"P. Koiran","year":"1997","unstructured":"Koiran, P.: A weak version of the Blum, Shub & Smale model. J.\u00a0Comp. Syst. Sci.\u00a054, 177\u2013189 (1997)","journal-title":"J.\u00a0Comp. Syst. Sci."},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1006\/jcom.1999.0502","volume":"15","author":"P. Koiran","year":"1999","unstructured":"Koiran, P.: The real dimension problem is NP\n R\n -complete. Journal of Complexity\u00a015(2), 227\u2013238 (1999)","journal-title":"Journal of Complexity"},{"issue":"3","key":"20_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. part I, II, III. J.\u00a0Symb. Comp.\u00a013(3), 255\u2013352 (1992)","journal-title":"J.\u00a0Symb. Comp."},{"issue":"1","key":"20_CR24","first-page":"1","volume":"3","author":"J. Larry","year":"1977","unstructured":"Larry, J.: The polynomial-time hierarchy. Theoret. Comput. Sci.\u00a03(1), 1\u201322 (1976\/1977)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:00Z","timestamp":1619518260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}