On the evaluation of some sparse polynomials

Dorian Nogneng, Éric Schost

Type: Article

Publication Date: 2016-12-15

Citations: 5

DOI: https://doi.org/10.1090/mcom/3231

View Publication

Locations

Mathematics of Computation - View
UWSpace (University of Waterloo) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Fast Computation of the Roots of Polynomials Over the Ring of Power Series	2017	Vincent Neiger Johan Rosenkilde Éric Schost
+	Double-Base Number System for Multi-Scalar Multiplications.	2008	Christophe Doche David Kohel Francesco Sica
+	What Can (and Can't) we Do with Sparse Polynomials?	2018	Daniel S. Roche
+ PDF Chat	Fast polynomial evaluation and composition	2013	Guillaume Moroz
+	Fast polynomial evaluation and composition	2013	Guillaume Moroz
+	Double-Base Number System for Multi-scalar Multiplications	2009	Christophe Doche David Kohel Francesco Sica
+	On the Enumeration of Irreducible Polynomials over $\text{GF}(q)$ with Prescribed Coefficients	2016	Robert Granger
+	Fast algorithm for border bases of Artinian Gorenstein algebras	2017	Bernard Mourrain
+	Fast algorithm for border bases of Artinian Gorenstein algebras	2017	Bernard Mourrain
+	Computing values of a polynomial with only few multiplications	1994	Darko Veljan
+	Root Repulsion and Faster Solving for Very Sparse Polynomials Over $p$-adic Fields	2021	J. Maurice Rojas Yuyu Zhu
+ PDF Chat	None	2013	Markus Blaeser
+	Groebner.jl: A package for Gröbner bases computations in Julia	2023	Alexander Demin Shashi Gowda
+	A complexity chasm for solving sparse polynomial equations over $p$-adic fields	2020	J. Maurice Rojas Yuyu Zhu
+	A complexity chasm for solving univariate sparse polynomial equations over $p$-adic fields	2020	J. Maurice Rojas Yuyu Zhu
+ PDF Chat	Computing Sparse Multiples of Polynomials	2010	Mark Giesbrecht Daniel S. Roche Hrushikesh Tilak
+ PDF Chat	Computing Sparse Multiples of Polynomials	2012	Mark Giesbrecht Daniel S. Roche Hrushikesh Tilak
+	Fast polynomial evaluation and interpolation	2013	Joachim von zur Gathen Jürgen Gerhard
+	On the generically superfast computation of Hankel determinants	1999	Marc Van Barel Peter Kravanja
+ PDF Chat	Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants	2019	Seung Gyu Hyun Vincent Neiger Éric Schost

Works That Cite This (5)

Action	Title	Year	Authors
+ PDF Chat	Arbitrary-precision computation of the gamma function	2023	Fredrik Johansson
+ PDF Chat	Fast computation of the N-th term of a q-holonomic sequence and applications	2022	Alin Bostan Sergey Yurkevich
+ PDF Chat	Computing the N-th term of a q-holonomic sequence	2020	Alin Bostan
+ PDF Chat	Numerical Evaluation of Elliptic Functions, Elliptic Integrals and Modular Forms	2019	Fredrik Johansson
+	Fast Computation of the $N$-th Term of a $q$-Holonomic Sequence and Applications	2020	Alin Bostan Sergey Yurkevich

Works Cited by This (21)

Action	Title	Year	Authors
+ PDF Chat	Introduction to Analytic Number Theory	1976	Tom M. Apostol
+	Improved sparse multivariate polynomial interpolation algorithms	1989	Erich Kaltofen Lakshman Yagati
+	Interpolating polynomials from their values	1990	Richard Zippel
+	Deterministic methods to find primes	2011	Terence Tao Ernest S. Croot H. A. Helfgott
+	A Brief Introduction to Theta Functions.	1964	Fritz Steinhardt Richard Bellman
+	A deterministic algorithm for sparse multivariate polynomial interpolation	1988	Michael Ben-Or Prasoon Tiwari
+ PDF Chat	Diversification improves interpolation	2011	Mark Giesbrecht Daniel S. Roche
+	On fast multiplication of polynomials over arbitrary algebras	1991	David G. Cantor Erich Kaltofen
+	Interpolation of polynomials given by straight-line programs	2009	Sanchit Garg Éric Schost
+ PDF Chat	Powers of tensors and fast matrix multiplication	2014	François Le Gall