Abstract
A new algorithm is presented to improve by a factor of log m the estimates for both parallel and sequential time complexity of division with a remainder of two integer polynomials. Under the parallel model, this means Boolean logarithmic time, which is asymptotically optimum. The algorithm exploits the reduction of the problem to integer division; the polynomial remainder and quotient are recovered from integer remainder and quotient via binary segmentation.
(Supported by NSF Grant DCR-8507573)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Bini, Parallel Solution of Certain Toeplitz Linear System, SIAM J. Comp. 13, 2, 268–276 (1984), also T.R.B82-04, I.E.I. of C.N.R., Pisa, Italy (April 1982).
P.W. Beam, S. Cook and H.J. Hoover, Log Depth Circuits for Division and Related Problems, Proc. 25-th Ann. IEEE FOCS Symp., 1–6 (1984).
A. Borodin, J. von zur Gathen, and J. Hopcroft, Fast Parallel Matrix and GCD Computations, Inform. and Control 53, 3 241–256 (1982).
A. Borodin and I. Munro, The Computational Complexity of Algebraic and Numeric Problems, American Elsevier, New York (1975).
D. Bini and V. Pan, Polynomial Division and Its Computational Complexity, Tech. Report TR 86-2, Computer Science Dept., SUNYA, Albany, NY (1986), to appear in Journal of Complexity.
M.J. Fischer and M.S. Paterson, String Matching and Other Products, SIAM-AMS Proc., 7, 113–125 (1974).
A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York (1970).
D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms 2, Addison-Wesley (1981).
V. Pan, The Bit-Operation Complexity of the Convolution of Vectors and of the DFT, Tech. Rep. TR 80-6, Computer Science Dept., SUNYA, Albany, N.Y. (1980).
V. Pan, How to Multiply Matrices Faster, Lecture Notes in Computer Science 179, Springer-Verlag (1984).
V. Pan, The Bit Complexity of Matrix Multiplication and of Related Computations in Linear Algebra. The Segmented λ Algorithms, Computers and Math. (with Applications) 11,9, 919–928 (1985).
V. Pan, Fast and Efficient Algorithms for the Exact Inversion of Integer Matrices, Proc. 5-th Conf. of Software Technology and Theoret. Comp. Sci., Indian Inst. of Techn., Delhi and Tata Inst. of Fundam. Research, New Delhi, India (1985).
V. Pan, Algebraic Complexity of Computing Polynomail Zeros, Tech. Report TR 85-27, Computer Sci. Dept., SUNYA, Albany, NY (December 1985).
J. Reif, Logarithmic Depth Circuits for Algebraic Functions, SIAM J. on Computing 15, 231–242 (1986).
J.E. Savage, The Complexity of Computing, John Wiley and Sons, N.Y. (1976).
A. Schönhage, Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coefficients, Proc. EUROCAM, (1982).
A. Schönhage, The Fundamental Theorem of Algebra in Terms of Computational Complexity, manuscript (1982).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bini, D., Pan, V. (1986). A logarithmic boolean time algorithm for parallel polynomial division. In: Makedon, F., Mehlhorn, K., Papatheodorou, T., Spirakis, P. (eds) VLSI Algorithms and Architectures. AWOC 1986. Lecture Notes in Computer Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16766-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-16766-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16766-2
Online ISBN: 978-3-540-38746-6
eBook Packages: Springer Book Archive