{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:20Z","timestamp":1725488960819},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_33","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"359-370","source":"Crossref","is-referenced-by-count":2,"title":["VPSPACE and a Transfer Theorem over the Complex Field"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Koiran","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Perifel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","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)"},{"issue":"1","key":"33_CR2","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: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society\u00a021(1), 1\u201346 (1989)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"33_CR3","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":"B\u00fcrgisser, P.: Completeness and Reduction in Algebraic Complexity Theory. Algorithms and Computation in Mathematics, vol.\u00a07. Springer, Heidelberg (2000)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44683-4_2","volume-title":"Mathematical Foundations of Computer Science 2001","author":"P. B\u00fcrgisser","year":"2001","unstructured":"B\u00fcrgisser, P.: On implications between P-NP-hypotheses: Decision versus computation in algebraic complexity. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 3\u201317. Springer, Heidelberg (2001)"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0168-0072(98)00060-8","volume":"99","author":"O. Chapuis","year":"1999","unstructured":"Chapuis, O., Koiran, P.: Saturation and stability in the theory of computation over the reals. Annals of Pure and Applied Logic\u00a099, 1\u201349 (1999)","journal-title":"Annals of Pure and Applied Logic"},{"key":"33_CR6","unstructured":"Charbit, P., Jeandel, E., Koiran, P., Perifel, S., Thomass\u00e9, S.: Finding a vector orthogonal to roughly half a collection of vectors. Accepted in Journal of Complexity (2006), available from \n                    \n                      http:\/\/prunel.ccsd.cnrs.fr\/ensl-00153736"},{"issue":"4","key":"33_CR7","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"Cole, R.: Parallel merge sort. SIAM J. Comput.\u00a017(4), 770\u2013785 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1137\/S0097539794270340","volume":"26","author":"F. Cucker","year":"1997","unstructured":"Cucker, F., Grigoriev, D.: On the power of real Turing machines over binary inputs. SIAM J. Comput.\u00a026(1), 243\u2013254 (1997)","journal-title":"SIAM J. Comput."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-4049(90)90159-F","volume":"67","author":"N. Fitchas","year":"1990","unstructured":"Fitchas, N., Galligo, A., Morgenstern, J.: Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields. Journal of Pure and Applied Algebra\u00a067, 1\u201314 (1990)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/jcom.1999.0527","volume":"16","author":"D. Grigoriev","year":"2000","unstructured":"Grigoriev, D.: Topological complexity of the range searching. Journal of Complexity\u00a016, 50\u201353 (2000)","journal-title":"Journal of Complexity"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Koiran, P.: Randomized and deterministic algorithms for the dimension of algebraic varieties. In: Proc. 38th FOCS, pp. 36\u201345 (1997)","DOI":"10.1109\/SFCS.1997.646091"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-46541-3_3","volume-title":"STACS 2000","author":"P. Koiran","year":"2000","unstructured":"Koiran, P.: Circuits versus trees in algebraic complexity. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 35\u201352. Springer, Heidelberg (2000)"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/11821069_52","volume-title":"Mathematical Foundations of Computer Science 2006","author":"P. Koiran","year":"2006","unstructured":"Koiran, P., Perifel, S.: Valiant\u2019s model: from exponential sums to exponential products. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 596\u2013607. Springer, Heidelberg (2006)"},{"key":"33_CR14","unstructured":"Koiran, P., Perifel, S.: VPSPACE and a transfer theorem over the complex field. Technical report, LIP, ENS Lyon (2007), Available from \n                    \n                      http:\/\/prunel.ccsd.cnrs.fr\/ensl-00153701"},{"key":"33_CR15","unstructured":"Koiran, P., Perifel, S.: VPSPACE and a transfer theorem over the reals. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 417\u2013428. Springer, Heidelberg (2007). Long version available from \n                    \n                      http:\/\/prunel.ccsd.cnrs.fr\/ensl-00103018"},{"key":"33_CR16","unstructured":"Malod, G.: Polyn\u00f4mes et coefficients. PhD thesis, Universit\u00e9 Claude Bernard Lyon 1 (July, 2003), available from \n                    \n                      http:\/\/tel.archives-ouvertes.fr\/tel-00087399"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/11821069_61","volume-title":"Mathematical Foundations of Computer Science 2006","author":"G. Malod","year":"2006","unstructured":"Malod, G., Portier, N.: Characterizing Valiant\u2019s algebraic complexity classes. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 704\u2013716. Springer, Heidelberg (2006)"},{"key":"33_CR18","unstructured":"Poizat, B.: Les petits cailloux. Al\u00e9as (1995)"},{"key":"33_CR19","first-page":"249","volume-title":"Proc. 11th ACM Symposium on Theory of Computing","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: Completeness classes in algebra. In: Proc. 11th ACM Symposium on Theory of Computing, pp. 249\u2013261. ACM Press, New York (1979)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:59Z","timestamp":1619519339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}