{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:27:38Z","timestamp":1773228458528,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0304-3975(93)00063-b","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"35-47","source":"Crossref","is-referenced-by-count":49,"title":["Computing over the reals with addition and order"],"prefix":"10.1016","volume":"133","author":[{"given":"P.","family":"Koiran","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)00063-B_BIB1","series-title":"EATCS Monographs on Theoretical Computer Science","article-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"issue":"1","key":"10.1016\/0304-3975(93)00063-B_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(93)00063-B_BIB3","doi-asserted-by":"crossref","unstructured":"M. Cosnard and M. Matamala, On NC real complexity classes for additive circuits and their relation with NC, presented at the Barcelona workshop on continuous algorithms and complexity, Theoret. Comput. Sci., submitted.","DOI":"10.1007\/3-540-58338-6_56"},{"key":"10.1016\/0304-3975(93)00063-B_BIB4","author":"Cucker","year":"1993","journal-title":"On digital nondeterminism"},{"key":"10.1016\/0304-3975(93)00063-B_BIB5","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(93)00063-B_BIB6","first-page":"486","article-title":"A weak version of the Blum, Shub and Smale model","author":"Koiran","year":"1993","journal-title":"Proc. 34th FOCS Symp"},{"key":"10.1016\/0304-3975(93)00063-B_BIB7","series-title":"Algebra","author":"Lang","year":"1965"},{"key":"10.1016\/0304-3975(93)00063-B_BIB8","first-page":"335","article-title":"Bounds for the computational power and learning complexity of analog neural nets","author":"Maass","year":"1993","journal-title":"Proc. 25th STOC"},{"key":"10.1016\/0304-3975(93)00063-B_BIB9","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0885-064X(92)90007-X","article-title":"A note on a P\u2260NP result for a restricted class of real machines","volume":"8","author":"Meer","year":"1992","journal-title":"J. Complexity"},{"key":"10.1016\/0304-3975(93)00063-B_BIB10","first-page":"435","article-title":"Une remarque \u00e0 propos des machines sur R introduites par Blum, Shub et Smale","volume":"309","author":"Michaux","year":"1989","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0304-3975(93)00063-B_BIB11","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0304-3975(93)00063-B_BIB12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(94)90178-3","article-title":"Neural networks with real weights: Analog computational complexity","volume":"131","author":"Siegelmann","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)00063-B_BIB13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(85)90076-6","article-title":"Real addition and the polynomial hierarchy","volume":"20","author":"Sontag","year":"1985","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759300063B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759300063B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:50:11Z","timestamp":1555116611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759300063B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["030439759300063B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)00063-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}