Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Ahrendt, T. Fast high-precision computation of complex square roots. In Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation: ISSAC’ 96, Lakshman, Y. N., Ed., ACM, New York, pp. 142–149.
2. Alt, H. Square rooting is as difficult as multiplication. Computing 21 (1979), 221–232.
3. Alt, H. Comparison of arithmetic functions with respect to Boolean circuit depth. In Proc. 16th Ann. ACM Symposium on Theory of Computing (1984), pp. 466–470.
4. Alt, H. Multiplication is the easiest nontrivial arithmetic function. Theoretical Comput. Sci. 36 (1985), 333–339.
5. Bailey, D. H. A portable high performance multiprecision package. RNR Technical Report RNR-90-022, NAS Applied Research Branch, NASA Ames Research Center, Moffett Filed, CA 94035, May 1993.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献