1 citations · 1 across the 2 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2025
Probably faster multiplication of sparse polynomials
Joris van der Hoeven
In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the…
cs.SC2025
Factoring sparse polynomials fast
Alexander Demin, Joris van der Hoeven
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms…