{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:16:06Z","timestamp":1648962966191},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0890-5401(03)00015-4","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:00:31Z","timestamp":1049504431000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Learning from rounded-off data"],"prefix":"10.1016","volume":"182","author":[{"given":"Dennis","family":"Cheung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felipe","family":"Cucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00015-4_BIB1","doi-asserted-by":"crossref","unstructured":"S. Basu, R. Pollack, M.-F. Roy, On the combinatorial and algebraic complexity of quantifier elimination, in: 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 632\u2013641","DOI":"10.1109\/SFCS.1994.365728"},{"key":"10.1016\/S0890-5401(03)00015-4_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. Am. Math. Soc."},{"key":"10.1016\/S0890-5401(03)00015-4_BIB3","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik\u2013Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0890-5401(03)00015-4_BIB4","series-title":"26th International Conference on Automata, Languages, and Programming","first-page":"55","article-title":"Real computations with fake numbers","volume":"1644","author":"Cucker","year":"1999"},{"key":"10.1016\/S0890-5401(03)00015-4_BIB5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00993408","article-title":"Bounding the Vapnik\u2013Chervonenkis dimension of concept classes parameterized by real numbers","volume":"18","author":"Goldberg","year":"1995","journal-title":"Mach. Learn."},{"key":"10.1016\/S0890-5401(03)00015-4_BIB6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.24033\/bsmf.2138","article-title":"Sur la complexit\u00e9 du principe de Tarski-Seidenberg","volume":"118","author":"Heintz","year":"1990","journal-title":"Bull. Soc. Math. Fr."},{"key":"10.1016\/S0890-5401(03)00015-4_BIB7","series-title":"An Introduction to Computational Learning Theory","author":"Kearns","year":"1994"},{"key":"10.1016\/S0890-5401(03)00015-4_BIB8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","article-title":"On the computational complexity and geometry of the first-order theory of the reals, Part I","volume":"13","author":"Renegar","year":"1992","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0890-5401(03)00015-4_BIB9","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/0805026","article-title":"Incorporating condition measures into the complexity theory of linear programming","volume":"5","author":"Renegar","year":"1995","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0890-5401(03)00015-4_BIB10","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T05:58:35Z","timestamp":1553666315000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103000154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0890540103000154"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00015-4","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}