{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:55Z","timestamp":1725663835123},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540567318"},{"type":"electronic","value":"9783540476375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56731-3_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:28:11Z","timestamp":1330255691000},"page":"37-46","source":"Crossref","is-referenced-by-count":0,"title":["Relations between models of parallel abstract machines"],"prefix":"10.1007","author":[{"given":"Michel","family":"Cosnard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Koiran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. Di\u00e1z, and J. Gabarr\u00f3. Structural Complexity I. EATCS monographs on theoretical computer science. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-97062-7"},{"issue":"1","key":"5_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. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21(1):1\u201346, July 1989.","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"2","key":"5_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1142\/S0129626491000057","volume":"1","author":"M. Cosnard","year":"1991","unstructured":"M. Cosnard and A. Ferreira. On the real power of loosely coupled parallel architectures. Parallel Processing Letters, 1(2):103\u2013112, 1991.","journal-title":"Parallel Processing Letters"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"M. Cosnard, M. Garson, and P. Koiran. Computability properties of low-dimensional systems. In Proceedings of STACS'9S, Lecture notes in computer science to appear. Springer Verlag, 1993.","DOI":"10.1007\/3-540-56503-5_37"},{"key":"5_CR5","unstructured":"F. Cucker and F. Rossello. On the complexity of some problems for the Blum, Shub and Smale model. In Proceedings of Latin'92, Lecture notes in computer science, pages 530\u2013545. Springer Verlag, 1992."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"R.M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. Handbook of Theoretical Computer Science, Vol. A Algorithms and complexity, pages 870\u2013941, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"5_CR7","unstructured":"P. Koiran. On the relations between dynamical systems and boolean circuits. Research Report in preparation, LIP, Ecole Normale Sup\u00e9rieure de Lyon, 1992."},{"key":"5_CR8","unstructured":"B. Martin. A universal parallel random-access machine based on cellular automata. Research Report, LIP, Ecole Normale Sup\u00e9rieure de Lyon, 1992."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and Shamos M.I. Computational Geometry. Springer, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"5_CR10","unstructured":"H. T. Siegelman and E. D. Sontag. Neural networks with real weights: analog computational complexity. COLT92 and SYCON Report 92-05, Rutgers University, September 1992."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"H. T. Siegelman and E. D. Sontag. On the computational power of neural nets. In Proc. Fifth ACM Workshop on Computational Learning Theory, July 1992.","DOI":"10.1145\/130385.130432"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"P. van Emde Boas. Machine models and simulations. Handbook of Theoretical Computer Science, Vol. A Algorithms and complexity, pages 3\u201366, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50006-0"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"F.F. Yao. Computational geometry. Handbook of Theoretical Computer Science, Vol. A Algorithms and complexity, pages 345\u2013389, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50012-6"}],"container-title":["Lecture Notes in Computer Science","Parallel Architectures and Their Efficient Use"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56731-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:31Z","timestamp":1605647131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56731-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540567318","9783540476375"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56731-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}