{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:39:00Z","timestamp":1743068340049,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780342_25","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"231-240","source":"Crossref","is-referenced-by-count":4,"title":["A Measure of Space for Computing over the Reals"],"prefix":"10.1007","author":[{"given":"Paulin Jacob\u00e9","family":"de Naurois","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","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":"25_CR2","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1137\/0206054","volume":"6","author":"A. Borodin","year":"1977","unstructured":"Borodin, A.: On relating time and space to size and depth. SIAM J. Comp.\u00a06, 733\u2013744 (1977)","journal-title":"SIAM J. Comp."},{"key":"25_CR3","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 Amer. Math. Soc.\u00a021, 1\u201346 (1989)","journal-title":"Bulletin of the Amer. Math. Soc."},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00069-7","volume":"133","author":"F. Cucker","year":"1994","unstructured":"Cucker, F., Shub, M., Smale, S.: Separation of complexity classes in Koiran\u2019s weak model. Theoretical Computer Science\u00a0133(1), 3\u201314 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"25_CR5","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(4), 454\u2013466 (1992)","journal-title":"Journal of Complexity"},{"key":"25_CR6","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\u211d\u2009\u2260\u2009NC\u211d. Journal of Complexity\u00a08, 230\u2013238 (1992)","journal-title":"Journal of Complexity"},{"key":"25_CR7","unstructured":"Gr\u00e4del, E., Meer, K.: Descriptive complexity theory over the real numbers. Lecture Notes in Applied Mathematics, vol.\u00a032, pp. 381\u2013404 (1996)"},{"key":"25_CR8","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. Journal of Computer and System Sciences\u00a054, 177\u2013189 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR9","unstructured":"Michaux, C.: Une remarque \u00e0 propos des machines sur \u211d introduites par Blum, Shub et Smale. In: C.R. Acad. Sci. Paris, S\u00e9ries I, vol.\u00a0309, pp. 435\u2013437 (1989)"},{"key":"25_CR10","unstructured":"Poizat, B.: Les Petits Cailloux. Al\u00e9as (1995)"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:04:47Z","timestamp":1552345487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11780342_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}