{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:31:10Z","timestamp":1787502670057,"version":"build-2736575974"},"reference-count":9,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1989]]},"DOI":"10.1051\/ita\/1989230101011","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:39:17Z","timestamp":1486031957000},"page":"101-111","source":"Crossref","is-referenced-by-count":5,"title":["On computations with integer division"],"prefix":"10.1051","volume":"23","author":[{"given":"Bettina","family":"Just","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BEN OR M., Lower bounds for Algebraic Computation Trees, Proc. 15th ACM STOC, 1983, pp. 80-86.","DOI":"10.1145\/800061.808735"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BABAI L., JUST B. and MEYER AUF DER HEIDE F., On the Limits of Computations with the Floor Functions, Information and Computation, 78 (2), 1988, pp. 99-107.9555780659.68051","DOI":"10.1016\/0890-5401(88)90031-4"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. CASSELS J. W. S., An Introduction to the Geometry of Numbers, Springer, Berlin, 1959; second printing, 1971.3061300086.26203","DOI":"10.1007\/978-3-642-62035-5"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. DOBKIN D. and LIPTON R., A Lower Bound of 1\/2n2 on Linear Search Programs for the Knapsack Problem, J..C.S.S., Vol. 16, 1975, pp. 417-421.0397.68045","DOI":"10.1007\/3-540-07854-1_185"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. HASTAD J., JUST B.,LAGARIAS J. and SCHNORR C. P., Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers, Proc. STACS, 1986, pp. 105-118.8277290606.68033","DOI":"10.1007\/3-540-16078-7_69"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. KLEIN P. and MEYER AUF DER HEIDE F., A Lower Bound for the Knapsack Problem on Random Access Machines, Act. Inf., Vol. 19, 1983, pp. 385-395.7179930515.68037","DOI":"10.1007\/BF00290735"},{"key":"R7","unstructured":"7. LENSTRA H. W. Jr, Integer Programming with a Fixed Number of Variables, Report 81-03, Mathematisch Instituut, Amsterdam, 1983.727410"},{"key":"R8","unstructured":"8. LAGARIAS J. C., LENSTRA H. W. Jr. and SCHNORR C. P., Karkine-Zolotareff Bases and Successive Minima of a Latice and its Reciprocla Lattice, preprint 1986."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. MEYER AUF DER HEIDE F., Lower Bounds for Solving Linear Diophantine equations on Random Acces Machines, J.ACM., Vol. 32 (4), 1985, pp. 929-937.8103440633.68031","DOI":"10.1145\/4221.4250"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230101011\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T02:05:02Z","timestamp":1568772302000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230101011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":9,"journal-issue":{"issue":"1"},"alternative-id":["ita1989230101011"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1989230101011","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}