{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T05:17:50Z","timestamp":1715404670906},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1007\/bf01272076","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T04:41:33Z","timestamp":1111639293000},"page":"244-255","source":"Crossref","is-referenced-by-count":8,"title":["Fast exponentiation using the truncation operation"],"prefix":"10.1007","volume":"2","author":[{"given":"Nader H.","family":"Bshouty","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[]},{"given":"Prasson","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"A. Aho, J. Hopcroft, andJ. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Ma, 1974."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0890-5401(88)90031-4","volume":"78","author":"L. Babai","year":"1988","unstructured":"L. Babai, B. Just, andF. Meyer auf der Heide,On the limits of computations with the floor function, Inform. and Comput.78 (1988), 99?107.","journal-title":"Inform. and Comput."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/TC.1985.5009381","volume":"34","author":"E. Dittert","year":"1985","unstructured":"E. Dittert andM. O'Donnell,Lower bounds for sorting with realistic instruction sets, IEEE Trans. on Computers34 (1985), 311?317. See also,Correction to: Lower bounds for sorting with realistic instruction sets, IEEE Trans. on Computers35 (1986), 932.","journal-title":"IEEE Trans. on Computers"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(83)90129-9","volume":"24","author":"O. H. Ibarra","year":"1983","unstructured":"O. H. Ibarra, S. Moran, andL. E. Rosier,On the control power of integer division, Theor. Computer Science24 (1983), 35?52.","journal-title":"Theor. Computer Science"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(85)90042-0","volume":"21","author":"C. Lautemann","year":"1985","unstructured":"C. Lautemann andF. Meyer auf der Heide,Lower time bounds for integer programming with two variables, Inform. Process. Lett.21 (1985), 101?105.","journal-title":"Inform. Process. Lett."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Y. Mansour, B. Schieber, and P. Tiwari,The complexity of approximating the square root, in Proc. 30th IEEE Symp. on Foundations of Computer Science, October 1989, 325?330.","DOI":"10.1109\/SFCS.1989.63498"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/103516.103522","volume":"38","author":"Y. Mansour","year":"1991","unstructured":"Y. Mansour, B. Schieber, andP. Tiwari,A lower bound for integer greatest common divisor computations, J. Assoc. Comput. Mach.38 (1991), 453?471.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1137\/0220020","volume":"20","author":"Y. Mansour","year":"1991","unstructured":"Y. Mansour, B. Schieber, andP. Tiwari,Lower bounds for computations with the floor operation, SIAM J. Comput.20 (1991), 315?327.","journal-title":"SIAM J. Comput."},{"key":"CR9","unstructured":"W. Paul and J. Simon,Decision trees and random access machines, in Monographie de L'Enseignement Math\u00e9matique30 (1981), 331?340."},{"key":"CR10","series-title":"Tech. Rep. RC 5954","volume-title":"Arithmetic versus boolean operations in idealized register machines","author":"L. Stockmeyer","year":"1976","unstructured":"L. Stockmeyer,Arithmetic versus boolean operations in idealized register machines, Tech. Rep. RC 5954, IBM T.J. Watson Research Center, Yorktown Heights, April 1976."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF00289512","volume":"1","author":"V. Strassen","year":"1972","unstructured":"V. Strassen,Berechnung und Programm I., Acta Inform.1 (1972), 320?335.","journal-title":"Acta Inform."}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01272076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01272076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01272076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:14:28Z","timestamp":1556648068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01272076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["BF01272076"],"URL":"https:\/\/doi.org\/10.1007\/bf01272076","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}