Effective polynomial computation

Keywords

Computation, Polynomial, Mathematics, Computer science, Algorithm

References

No references recorded for this paper.

Cited by

• Real Factorization of Multivariate Polynomials with Integer CoefficientsAndré Galligo — 2002
• On the resultant of degree-deficient polynomialsA Lifshitz, Y. Bistritz — 2007
• Generalized Companion Matrices in the Lagrange BasesRobert M. Corless — 2004
• Modular Arithmetic Decision ProcedureDomagoj Babić, Madan Musuvathi — 2005
• More on pseudozeros for univariate polynomialsStef Graillat, Philippe Langlois, Paul Alduy — 2004
• Contributions à la résolution des systèmes algébriques : réduction, localisation, traitement des singularités ; implantations. (Contributions to algebraic system solving: reduction, localization, singularities handling; implementations)Jérémy Berthomieu — 2011
• Algoritmos de deformación para la resolución de sistemas polinomialesAriel Waissbein — 2013
• Spreading rumors cheaply, quickly, and reliablyFred B. Schneider, Yaron Minsky — 2002
• Learning polynomials with queries: The highly noisy caseOded Goldreich, Ronitt Rubinfeld, Madhu Sudan — 1995
• SPARSE POLYNOMIAL INTERPOLATION AND THE FAST EUCLIDEAN ALGORITHMSoo H. Go — 2012
• Computer Algebra and Symbolic Computation: Mathematical MethodsJoel S. Cohen — 2003
• Factorization of multivariate polynomialsMartin Mok-Don Lee — 2013
• Geometric operations using sparse interpolation matricesIoannis Z. Emiris, Tatjana Kalinka, Christos Konaxis — 2015
• GCD of Many IntegersGene Cooperman, Sandra Feisel, Joachim von zur Gathen — 1999
• Sparse implicitization by interpolation: Geometric computations using matrix representationsIoannis Z. Emiris, Tatjana Kalinka, Christos Konaxis — 2014
• Modern computer algebraJ. Gathen, Jürgen Gerhard — 2002
• Algorithmes parallèles efficaces pour le calcul formel : algèbre linéaire creuse et extensions algébriques. (Efficient parallel algorithm for computer algebra : sparce linear algebra and algebraic extensions)Jean‐Guillaume Dumas — 2000
• Factorization of multivariate polynomials over finite fieldsLaurent Bernardin — 1999
• TR-2004013: Toeplitz and Hankel Meet Hensel and Newton: Nearly Optimal Algorithms and Their Practical Acceleration with Saturated InitializationVictor Y. Pan, Brian J. Murphy, Rhys Eric Rosholt — 2004
• Integrating Computer Algebra into Proof PlanningManfred Kerber, Michael Kohlhase, Volker Sorge — 1998

Related papers

• Almost-convergent sequences with respect to polynomial hypergroupsRupert Lasser — 2013
• Positive oriented periodic solutions of the first-order complex ODE with polynomial nonlinear partAndrei Borisovich, Wacław Marzantowicz — 2006
• Laws of large numbers for polynomial hypergroups and some applicationsMichael Voit — 1990
• Subsets of R which support hypergroups with polynomial charactersWilliam C. Connett, Alan L. Schwartz — 1995
• The polynomial method over varietiesMiguel N. Walsh — 2018
• A Gauss-Lucas theorem on the location of the roots of a polynomialMartin Buhmann, T. J. Rivlin — 1991
• Positive polynomials and hyperdeterminantsFernando Cukierman — 2007
• Pólya's Theorem with zerosMari Castle, Victoria Powers, Bruce Reznick — 2011