{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T17:15:56Z","timestamp":1720890956617},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0020-0190(97)00126-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"211-213","source":"Crossref","is-referenced-by-count":2,"title":["A tight bound for approximating the square root"],"prefix":"10.1016","volume":"63","author":[{"given":"Nader H.","family":"Bshouty","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[]},{"given":"Prasoon","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00126-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0020-0190(97)00126-9_BIB2","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"80","article-title":"Lower bounds for algebraic computation trees","author":"Ben-Or","year":"1983"},{"key":"10.1016\/S0020-0190(97)00126-9_BIB3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/BF01272076","article-title":"Fast exponentiation using the truncation operation","volume":"2","author":"Bshouty","year":"1992","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0020-0190(97)00126-9_BIB4","series-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science","first-page":"325","article-title":"The complexity of approximating the square root","author":"Mansour","year":"1989"},{"issue":"2","key":"10.1016\/S0020-0190(97)00126-9_BIB5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1137\/0220020","article-title":"Lower bounds for computations with the floor operation","volume":"20","author":"Mansour","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00126-9_BIB6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0885-064X(87)90022-7","article-title":"On the worst-case arithmetic complexity of approximating zeros of polynomials","volume":"3","author":"Renegar","year":"1987","journal-title":"J. Complexity"},{"key":"10.1016\/S0020-0190(97)00126-9_BIB7","series-title":"Proc. 6th ICALP","first-page":"520","article-title":"On the power of random access machines","volume":"Vol. 71","author":"Sch\u00f6nhage","year":"1979"},{"key":"10.1016\/S0020-0190(97)00126-9_BIB8","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF00289512","article-title":"Berechnung und Programm I","volume":"1","author":"Strassen","year":"1972","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/S0020-0190(97)00126-9_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0212001","article-title":"The computational complexity of continued fractions","volume":"12","author":"Strassen","year":"1983","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001269?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001269?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:26:20Z","timestamp":1556058380000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0020019097001269"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00126-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}