A new modular interpolation algorithm for factoring multivariate polynomials

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present a technique that uses a new interpolation scheme to reconstruct a multivariate polynomial factorization from a number of univariate factorizations. Whereas other interpolation algorithms for polynomial factorization depend on various extensions of the Hilbert irreducibility theorem, our approach is the first to depend only upon the classical formulation. The key to our technique is the interpolation scheme for multivalued black boxes originally developed by Ar et. al. [1]. We feel that this combination of the classical Hilbert irreducibility theorem and multivalued black boxes provides a particularly simple and intuitive approach to polynomial factorization.

Cite

CITATION STYLE

APA

Rubinfeld, R., & Zippel, R. (1994). A new modular interpolation algorithm for factoring multivariate polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 877 LNCS, pp. 93–107). Springer Verlag. https://doi.org/10.1007/3-540-58691-1_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free