Fast interpolation and multiplication of unbalanced polynomials
From MaRDI portal
Cites work
- (Nearly) sample-optimal sparse Fourier transform
- -discrepancy sets and their application for interpolation of sparse polynomials
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
- A new deterministic algorithm for sparse multivariate polynomial interpolation
- Approximate formulas for some functions of prime numbers
- Chunky and equal-spaced polynomial multiplication
- Deterministic sparse FFT for M-sparse vectors
- Diversification improves interpolation
- Early termination in sparse interpolation algorithms
- Efficient algorithms for order basis computation
- Essentially optimal sparse polynomial multiplication
- Fast multiplication of large numbers
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Fast polynomial transform algorithms for digital convolution
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
- Faster polynomial multiplication over finite fields
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Festschrift zu Herrn Ernst Eduard Kummers fünfzigjährigem Doctor-Jubiläum, 10 September 1881)
- scientific article; zbMATH DE number 3856407 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- Integer multiplication in time \(O(n\log n)\)
- Interpolating polynomials from their values
- Interpolation of polynomials given by straight-line programs
- Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
- Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
- Multivariate sparse interpolation using randomized Kronecker substitutions
- Nearly Optimal Sparse Polynomial Multiplication
- On exact and approximate interpolation of sparse rational functions
- On fast multiplication of polynomials over arbitrary algebras
- On sparse interpolation of rational functions and gcds
- On the complexity of multivariate blockwise polynomial multiplication
- Output-sensitive algorithms for sumset and sparse polynomial multiplication
- Parallel sparse polynomial multiplication using heaps
- Polynomial modular product verification and its implications
- Polynomial multiplication over finite fields in time O(n n)
- Randomized Interpolation and Approximation of Sparse Polynomials
- Rank-sensitive computation of the rank profile of a polynomial matrix
- Revisit sparse polynomial interpolation based on randomized Kronecker substitution
- Sparse interpolation of multivariate rational functions
- Sparse interpolation over finite fields via low-order roots of unity
- Sparse polynomial division using a heap
- Sparse polynomial interpolation and division in soft-linear time
- Sparse polynomial interpolation based on derivatives
- Sparse polynomial interpolation based on diversification
- Sparse polynomial interpolation over fields with large or zero characteristic
- Structured FFT and TFT: symmetric and lattice polynomials
- Supersparse black box rational function interpolation
- Univariate polynomials with long unbalanced coefficients as bivariate balanced ones: a Toom-Cook multiplication approach
- Verifying candidate matches in sparse and wildcard matching
This page was built for publication: Fast interpolation and multiplication of unbalanced polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033513)
