{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:31:04Z","timestamp":1787340664847,"version":"build-2736575974"},"reference-count":29,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1991,4]]},"abstract":"<jats:p>A general lower bound technique is developed for computation trees with operations $\\{ + , - , * ,\/,\\lfloor \\cdot \\rfloor , &lt; \\} $ and constants $\\{ 0,1\\} $, for functions that have as their input a single n-bit integer. The technique applies to many natural functions, such as perfect square root (deciding if the square root of the input is integral or not), computing the parity of $\\lfloor {\\log x} \\rfloor $ , etc. The arguments are then extended to obtain the same lower bounds on the time complexity of any RAM program with operations $\\{ + , - , * ,\/,\\lfloor \\cdot \\rfloor , &lt; \\} $ that solves the problem. Another related result is described in a companion paper [Proc. 29th IEEE Symposium on Foundations of Computer Science, 1988] and [J. Assoc. Comput. Mach., 1991, to appear].<\/jats:p>","DOI":"10.1137\/0220020","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:34:57Z","timestamp":1109226897000},"page":"315-327","source":"Crossref","is-referenced-by-count":14,"title":["Lower Bounds for Computations with the Floor Operation"],"prefix":"10.1137","volume":"20","author":[{"given":"Yishay","family":"Mansour","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prasoon","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"R2","unstructured":"M. Ben-Or,  Lower bounds for algebraic computation trees,  Proc. 15th ACM Symposium on Theory of Computing, Boston, MA,  1983,  80\u201386, May"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90031-4"},{"key":"R4","volume-title":"An introduction to the geometry of numbers","author":"Cassels J. W. S.","year":"1971"},{"key":"R5","unstructured":"A. Cobham,  The recognition problem for the set of perfect squares, Tech. Report, RC 1704, IBM T. J. Watson Research Center, Yorktown Heights, NY,  1966, April"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676690"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676690"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4"},{"key":"R8","volume-title":"The numerical treatment of a single nonlinear equation","author":"Householder A. S.","year":"1970"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90129-9"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1989230101011"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80027-3"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90042-0"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028969"},{"key":"R14","unstructured":"Y. Mansour, B. Schieber, P. Tiwari,  A lower bound for integer greatest common divisor computations, Tech. Report, RC 14271, IBM T. J. Watson Research Center, Yorktown Heights, NY,  1988, December"},{"key":"R15","unstructured":"Y. Mansour, B. Schieber, P. Tiwari,  Lower bounds for integer greatest common divisor computations, in Proc. 29th IEEE Symposium on Foundations of Computer Science, October 1988, pp. 51\u201363; also in: Tech. Report TR 14271, IBM T. J. Watson Research Center, Yorktown Heights, NY, December 1988 and J. Assoc. Comput. Mach., to appear"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035783"},{"key":"R17","unstructured":"Y. Mansour, B. Schieber, P. Tiwari,  The complexity of approximating the square-root,  Proc. 30th IEEE Symposium on Foundations of Computer Science,  1989,  325\u2013330, October"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_5"},{"key":"R19","series-title":"Monograph. Enseign. Math.","first-page":"331","volume-title":"Logic and algorithmic (Zurich, 1980)","volume":"30","author":"Paul W.","year":"1982"},{"key":"R20","volume-title":"A first course in numerical analysis","author":"Ralston Anthony","year":"1965"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09510-1_42"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90129-6"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90041-6"},{"key":"R24","unstructured":"L. Stockmeyer,  Arithmetic versus boolean operations in idealized register machines, Tech. Report, RC 5954, IBM T. J. Watson Research Center, Yorktown Heights, NY,  1976, April"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289512"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1137\/0212001"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90002-5"},{"key":"R28","unstructured":"A. C. Yao,  Lower bounds for algebraic computation trees with integer inputs,  Proc. 30th IEEE Symposium on Foundations of Computer Science,  1989,  308\u2013313, October"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0220020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:43:22Z","timestamp":1787337802000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0220020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["10.1137\/0220020"],"URL":"https:\/\/doi.org\/10.1137\/0220020","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}