{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:16:20Z","timestamp":1725455780503},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023823","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:17:40Z","timestamp":1132381060000},"page":"117-129","source":"Crossref","is-referenced-by-count":6,"title":["On the complexity of some problems for the Blum, Shub & Smale model"],"prefix":"10.1007","author":[{"given":"Felipe","family":"Cucker","sequence":"first","affiliation":[]},{"given":"Francesc","family":"Rossell\u00f3","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz and J. Gabarr\u00f3; Structural Complexity, vol.1, EATCS Monographs of Theoretical Computer Science, Springer Verlag, 1988.","DOI":"10.1007\/978-3-642-97062-7_1"},{"issue":"n.1","key":"12_CR2","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; \u201cOn a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines\u201d. Bulletin of the Amer. Math. Soc., vol.21, n.1, pp.1\u201346, 1989. A preliminary version appeared in 29th Found. of Comp. Sc. pp.387\u2013397, 1988.","journal-title":"Bulletin of the Amer. Math. Soc."},{"key":"12_CR3","unstructured":"J. Bochnak, M. Coste and M.-F. Roy; G\u00e9om\u00e9trie alg\u00e9brique r\u00e9elle. Ergebnisse der Math., 3.Folge, Band 12, Springer Verlag, 1987."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0747-7171(88)80006-3","volume":"5","author":"D. Grigor\u2032","year":"1988","unstructured":"D. Grigor\u2032; \u201cComplexity of deciding Tarski algebra\u201d. J. of Symb. Comp., 5, pp.65\u2013108, 1988.","journal-title":"J. of Symb. Comp."},{"key":"12_CR5","unstructured":"J. Heintz, T. Krick, M.-F. Roy and P. Solerno;\u201cSingle exponential time algorithms for basic constructions in elementary geometry\u201d, Proceedings of the 10th Int. Conf. of the Chilean Comp. Sc. Soc., Santiago de Chile, 1990."},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"01","DOI":"10.24033\/bsmf.2133","volume":"118","author":"J. Heintz","year":"1990","unstructured":"J. Heintz, M.-F. Roy and P. Solerno; \u201cSur la complexit\u00e9 du principe de Tarski-Seidenberg\u201d. Bull. Soc. Math. France, 118, pp.101\u2013126, 1990.","journal-title":"Bull. Soc. Math. France"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"M. Mignote; \u201cSome useful bounds\u201d in Computer Algebra, Symbolic and Algebraic Computation, pp.259\u2013263, Springer Verlag, 1982.","DOI":"10.1007\/978-3-7091-3406-1_16"},{"key":"12_CR8","unstructured":"J. Renegar; \u201cOn the computational complexity and geometry of the first order thery of the reals\u201d, parts I, II and III. Cornell University, Technical Reports 853,854 and 856, 1989."}],"container-title":["Lecture Notes in Computer Science","LATIN '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023823.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:43Z","timestamp":1607550643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552847"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0023823","relation":{},"subject":[]}}