{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:58:10Z","timestamp":1776765490803,"version":"3.51.2"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100010690","name":"Toyota Physical and Chemical Research Institute","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010690","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["62580017"],"award-info":[{"award-number":["62580017"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0022-0000(89)90046-9","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"236-247","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["On finite-precision representations of geometric objects"],"prefix":"10.1016","volume":"39","author":[{"given":"Kokichi","family":"Sugihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90046-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","article-title":"On Lovasz lattice reduction and the nearest lattice point problem","volume":"6","author":"Babai","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0022-0000(89)90046-9_BIB2","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1090\/S0025-5718-1975-0379386-6","article-title":"How to calculate shortest vectors in a lattice","volume":"29","author":"Dieter","year":"1975","journal-title":"Math. Comp."},{"key":"10.1016\/0022-0000(89)90046-9_BIB3","series-title":"Proc. 27th ACM Annual Symp. on Foundations of Comput. Sci.","first-page":"143","article-title":"Finite-resolution computational geometry","author":"Greene","year":"1986"},{"key":"10.1016\/0022-0000(89)90046-9_BIB4","first-page":"421","article-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1960"},{"key":"10.1016\/0022-0000(89)90046-9_BIB5","series-title":"Computer Algebra","first-page":"236","article-title":"On the complexity of finding short vectors in integer lattice","volume":"Vol. 162","author":"Kaltofen","year":"1983"},{"key":"10.1016\/0022-0000(89)90046-9_BIB6","first-page":"688","author":"Knuth","year":"1969"},{"key":"10.1016\/0022-0000(89)90046-9_BIB7","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0214016","article-title":"The computational complexity of simultaneous Diophantine approximation problems","volume":"14","author":"Lagarias","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90046-9_BIB8","series-title":"Proc. Int. Symp. Symbolic and Algebraic Computations","first-page":"272","article-title":"Polynomial factorization by root approximation","volume":"Vol. 174","author":"Lenstra","year":"1984"},{"key":"10.1016\/0022-0000(89)90046-9_BIB9","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"key":"10.1016\/0022-0000(89)90046-9_BIB10","first-page":"91","article-title":"An Algorithm Theory of Numbers, Graphs and Convexity","author":"Lovasz","year":"1986"},{"key":"10.1016\/0022-0000(89)90046-9_BIB11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF03167060","article-title":"A theory of computer rational numbers","author":"Moriguti","year":"1984","journal-title":"Japan J. Appl. Math."},{"key":"10.1016\/0022-0000(89)90046-9_BIB12","first-page":"962","article-title":"An approach to error-free solid modelling","volume":"28","author":"Sugihara","year":"1987","journal-title":"Trans. Inform. Process. Soc. Japan"},{"key":"10.1016\/0022-0000(89)90046-9_BIB13","first-page":"416","article-title":"Shotou Seisuuron Kougi","author":"Takagi","year":"1971"},{"key":"10.1016\/0022-0000(89)90046-9_BIB14","first-page":"543","article-title":"On computational accuracy in determining the sign of an algebraic quantity","volume":"J69-A","author":"Yoshida","year":"1986","journal-title":"Trans. Inst. Electronics Inform. Comm. Eng. Japan"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900469?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900469?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:10:53Z","timestamp":1757095853000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0022000089900469"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90046-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On finite-precision representations of geometric objects","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(89)90046-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}