{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:29Z","timestamp":1761611069652},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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":[[2001,3]]},"DOI":"10.1016\/s0304-3975(00)00203-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:54Z","timestamp":1027633914000},"page":"607-610","source":"Crossref","is-referenced-by-count":4,"title":["Sparse NP-complete problems over the reals with addition"],"prefix":"10.1016","volume":"255","author":[{"given":"Herv\u00e9","family":"Fournier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00203-6_BIB1","series-title":"Complexity and Real Computation","author":"Blum","year":"1998"},{"issue":"1","key":"10.1016\/S0304-3975(00)00203-6_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\/S0304-3975(00)00203-6_BIB3","doi-asserted-by":"crossref","unstructured":"J. Cai, M. Ogihara, Sparse sets versus complexity classes, in: L. Hemspaandra, A. Selman (Eds.), Complexity Theory Retrospective II, Springer, Berlin, 1997.","DOI":"10.1007\/978-1-4612-1872-2_3"},{"key":"10.1016\/S0304-3975(00)00203-6_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0020-0190(97)00060-4","article-title":"Complexity and dimension","volume":"62","author":"Cucker","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00203-6_BIB5","doi-asserted-by":"crossref","unstructured":"H. Fournier, P. Koiran, Lower bounds are not easier over the reals: Inside PH, LIP Research Report 99-21, Ecole Normale Sup\u00e9rieure de Lyon, 1999.","DOI":"10.1145\/276698.276864"},{"key":"10.1016\/S0304-3975(00)00203-6_BIB6","unstructured":"B. Poizat, Les Petits Cailloux. Nur Al-Mantiq Wal-Ma'rifah 3. Al\u00e9as, Lyon, 1995."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002036?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002036?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T18:14:25Z","timestamp":1580235265000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397500002036"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00203-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}