Fast exponentiation using the truncation operation
暂无分享,去创建一个
[1] Friedhelm Meyer auf der Heide,et al. On the Limits of Computations with the Floor Function , 1988, Inf. Comput..
[2] Michael J. O'Donnell,et al. Lower Bounds for Sorting with Realistic Instruction Sets , 1985, IEEE Transactions on Computers.
[3] Baruch Schieber,et al. A lower bound for integer greatest common divisor computations , 1991, JACM.
[4] Baruch Schieber,et al. The complexity of approximating the square root , 1989, 30th Annual Symposium on Foundations of Computer Science.
[5] Volker Strassen. Berechnung und programm. I , 2004, Acta Informatica.
[6] Oscar H. Ibarra,et al. On the Control Power of Integer Division , 1983, Theor. Comput. Sci..
[7] Volker Strassen,et al. Berechnung und Programm. II , 1973, Acta Informatica.
[8] Friedhelm Meyer auf der Heide,et al. Lower Time Bounds for Integer Programming with Two Variables , 1985, Inf. Process. Lett..
[9] Baruch Schieber,et al. Lower Bounds for Computations with the Floor Operation , 1989, SIAM J. Comput..
[10] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .