{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:45Z","timestamp":1725663405921},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_163","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:39:00Z","timestamp":1330209540000},"page":"556-565","source":"Crossref","is-referenced-by-count":1,"title":["Two P-complete problems in the theory of the reals"],"prefix":"10.1007","author":[{"given":"F.","family":"Cucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Torrecillas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"43_CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman; The design and analysis of computer algorithms. Addison-Wesley, Reading, Mass., 1974."},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz and J. Gabarr\u00f3; Structural Complexity. vol. 2, EATCS Monographs of Theoretical Computer Science, Springer Verlag, 1990.","DOI":"10.1007\/978-3-642-75357-2"},{"key":"43_CR3","first-page":"80","volume":"5","author":"M. Ben-Or","year":"1988","unstructured":"M. Ben-Or; \u201cLower bounds for algebraic computation trees\u201d. A.C.M. Symp. on Theory of Computing 5, pp.80\u201386, 1988.","journal-title":"A.C.M. Symp. on Theory of Computing"},{"issue":"1","key":"43_CR4","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.","journal-title":"Bulletin of the Amer. Math. Soc.."},{"key":"43_CR5","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":"43_CR6","first-page":"93","volume":"233","author":"J. Gathen von zur","year":"1986","unstructured":"J. von zur Gathen; \u201cParallel arithmetic computations: a survey\u201d, Proc. 12 th Int. Symp. Math. Found. Comp. Sc., LNCS 233, pp.93\u2013112, Springer Verlag, 1986.","journal-title":"LNCS"},{"key":"43_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1146\/annurev.cs.03.060188.001533","volume":"3","author":"J. Gathen von zur","year":"1988","unstructured":"J. von zur Gathen; \u201cAlgebraic complexity theory\u201d, Ann. Rev. Comput. Sci., 3, pp.317\u2013347, 1988.","journal-title":"Ann. Rev. Comput. Sci."},{"key":"43_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N.D. Jones","year":"1977","unstructured":"N.D. Jones and W.T. Laaser; \u201cComplete problems for deterministic polynomial time\u201d, Theor. Comp. Sc. 3, pp.105\u2013117, 1977.","journal-title":"Theor. Comp. Sc."},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and M.I. Shamos; Computational Geometry: an introduction. Texts and Monographs in Computer Science, Springer Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"43_CR10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L.J. Stockmeyer","year":"1984","unstructured":"L.J. Stockmeyer and U. Vishkin; \u201cSimulation of parallel random access machines by circuits\u201d, SIAM J. on Comp. 13, pp.409\u2013422, 1984.","journal-title":"SIAM J. on Comp."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_163.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:19Z","timestamp":1605646399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_163","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}