Kronecker substitution is a technique named after Leopold Kronecker for determining the coefficients of an unknown polynomial by evaluating it at a single value. If p(x) is a polynomial with integer coefficients, and x is chosen to be both a power of two and larger in magnitude than any of the coefficients of p, then the coefficients of each term of can be read directly out of the binary representation of p(x).

One application of this method is to reduce the computational problem of multiplying polynomials to the (potentially simpler) problem of multiplying integers. If p(x) and q(x) are polynomials with known coefficients, then one can use these coefficients to determine a value of x that is a large enough power of two for the coefficients of the product pq(x) to be able to be read off from the binary representation of the number p(x)q(x). Since p(x) and q(x) are themselves straightforward to determine from the coefficients of p and q, this result shows that polynomial multiplication may be performed in the time of a single binary multiplication.[1]

See also

References

  1. ↑ von zur Gathen, Joachim; Gerhard, Jürgen (1999), Modern Computer Algebra, Cambridge University Press, pp. 243–244, ISBN 978-0-521-64176-0.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.