Fast interpolation of multivariate polynomials with sparse exponents

Numerical interpolation (65D05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) General topics in the theory of algorithms (68W01)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Interpolation of polynomials given by straight-line programs
The complexity of sparse polynomial interpolation over finite fields
Sparse multivariate Hensel lifting: a high-performance design and implementation
PRIMES is in P
Sparse polynomial arithmetic with the BPAS library
On the bit-complexity of sparse polynomial and series multiplication
Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
Approximate formulas for some functions of prime numbers
Faster sparse multivariate polynomial interpolation of straight-line programs
Integer multiplication in time \(O(n\log n)\)
Randomized root finding over finite FFT-fields using tangent Graeffe transforms
Modern Computer Algebra
A Fast Parallel Sparse Polynomial GCD Algorithm
Modular SIMD arithmetic in M <scp>athemagix</scp>
Sparse interpolation over finite fields via low-order roots of unity
Multivariate sparse interpolation using randomized Kronecker substitutions
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
Majorations Explicites Pour le Nombre de Diviseurs de N
Simultaneous Conversions with the Residue Number System Using Linear Algebra
Dagwood
What Can (and Can't) we Do with Sparse Polynomials?
Sparse Polynomial Interpolation over Fields with Large or Zero Characteristic
Using sparse interpolation to solve multivariate diophantine equations
Sparse polynomials in FLINT

This page was built for publication: Fast interpolation of multivariate polynomials with sparse exponents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665433)