1. Alt, H., Multiplication is the easiest nontrivial arithmetic function, Theoret. Comput. Sci.
36 (1985) 333–339
2. Brent, R.P., The complexity of multiple precision arithmetic, Proc. Seminar on Complexity of Computational Problem Solving, (Queensland U. Press, Brisbane, Australia, 1975) 126–165
3. Brent, R.P., Fast multiple precision evaluation of elementary functions, J. ACM
23 (1976) 242–251
4. Deil, T., Darstellungen und Berechenbarkeit reeler Zahlen, Informatik Berichte
51, Fern Universität Hagen (1984)
5. Ko, K. and Friedman, H., Computational complexity of real functions, Theoret. Comput. Sci.
20 (1982) 323–352