Probabilistic algorithms for sparse polynomials

Richard Zippel

Type: Book-Chapter

Publication Date: 1979-01-01

Citations: 1140

DOI: https://doi.org/10.1007/3-540-09519-5_73

Similar Works

Action	Title	Year	Authors
+	A probabilistic and deterministic modular algorithm for computing Groebner basis over $\Q$	2013	Bernard Parisse
+	Techniques for generating polynomials	1974	Arthur Hausner
+	The complexity of sparse Hensel lifting and sparse polynomial factorization	2019	Michael Monagan Baris Tuncer
+ PDF Chat	Probabilistic algorithms for computing resultants	2005	Michael Monagan
+	Sparse Polynomials	2009
+	Sparse Polynomials	2009
+	Probabilistic approach to Appell polynomials	2014	Bao Quoc Ta
+	Factoring non-monic polynomials represented by black boxes	2022	Tian Chen Michael Monagan
+ PDF Chat	Modular algorithms for computing Gröbner bases	2003	Elizabeth Arnold
+	Polynomial Theory	1984	Manfred R. Schroeder
+	Sparse shifts for univariate polynomials	1996	Y. N. Lakshman B. David Saunders
+	Sparse Shifts for Univariate Polynomials	1997	Y. N. Lakshman B. David Saunders
+ PDF Chat	None	2013	Markus Blaeser
+	Polynomial Theory	1997	Manfred R. Schroeder
+	Polynomial Theory	1986	Manfred R. Schroeder
+	Polynomial division	2019	John Bird
+	A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number.	1986	René Peralta Jeroen van de Graaf
+	Polynomials	2012	David A. Cox
+	Probabilistic Tests with Polynomials	1992	Dexter Kozen
+	Polynomials	1986	Egbert Brieskorn Horst Knörrer

Action	Title	Year	Authors
+	Représentations des polynômes, algorithmes et bornes inférieures	2012	Bruno Grenet
+	Computing isomorphisms between lattices	2020	Tommy Hofmann Henri Johnston
+ PDF Chat	Estimating the norms of random circulant and Toeplitz matrices and their inverses	2014	Victor Y. Pan John Svadlenka Liang Zhao
+	On groups with unbounded Cayley graphs	2020	Jakob Schneider
+ PDF Chat	Integral reduction with Kira 2.0 and finite field methods	2021	J. Klappert Fabian Lange Philipp Maierhöfer Johann Usovitsch
+	Connections between graphs and matrix spaces	2023	Yinan Li Youming Qiao Avi Wigderson Yuval Wigderson Chuanqi Zhang
+	The complexity of tensor calculus	2002	Carsten Damm Markus Holzer Pierre McKenzie
+	The complexity of tensor calculus	2002	Carsten Damm Markus Holzer Pierre McKenzie
+	Random Walks and Rapid Mixing	2011	Cristopher Moore Stephan Mertens
+	Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients	2017	Qiao-Long Huang Xiao-Shan Gao

Action	Title	Year	Authors
+	Probabilistic algorithms for sparse polynomials	1979	Richard Zippel
+ PDF Chat	On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors	1971	Warren S. Brown
+	On Hensel factorization, I	1969	Hans Zassenhaus
+	The EZ GCD algorithm	1973	Joel Moses David Y. Y. Yun