Interpolating polynomials from their values
From MaRDI portal
Publication:915342
DOI10.1016/S0747-7171(08)80018-1zbMATH Open0702.65011OpenAlexW2026317840MaRDI QIDQ915342FDOQ915342
Authors: Richard Zippel 
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80018-1
Recommendations
Complexity and performance of numerical algorithms (65Y20) Numerical interpolation (65D05) Interpolation in approximation theory (41A05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Title not available (Why is that?)
- Approximate formulas for some functions of prime numbers
- Factoring sparse multivariate polynomials
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Title not available (Why is that?)
- Irreducibility of multivariate polynomials
- An Improved Multivariate Polynomial Factoring Algorithm
- Factoring Multivariate Polynomials Over the Integers
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Cited In (52)
- Sparse multiplication of multivariate linear differential operators
- One loop QCD corrections to \(gg\rightarrow t\bar{t}H\) at \(\mathcal{O}(\epsilon^2)\)
- Incremental delay enumeration: space and time
- Sparse shifts for univariate polynomials
- Foreword
- Interpolation of polynomials given by straight-line programs
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- An interpolation algorithm for computing Dixon resultants
- Reconstructing rational functions with \texttt{FireFly}
- The complexity of sparse Hensel lifting and sparse polynomial factorization
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
- On the complexities of multipoint evaluation and interpolation
- Using sparse interpolation to solve multivariate diophantine equations
- Implicitization of curves and (hyper)surfaces using predicted support
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Interpolation polynomials. Application in findingsome combinatorial formulas
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- Black-box polynomial resultants
- Exploring crypto dark matter: new simple PRF candidates and their applications
- On learning multivariate polynomials under the uniform distribution
- A fast parallel sparse polynomial GCD algorithm
- An effective hybrid algorithm for computing symbolic determinants
- A New Black Box Factorization Algorithm - the Non-monic Case
- Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly}
- Balancing act: multivariate rational reconstruction for IBP
- Reconstructing Algebraic Functions from Mixed Data
- Structured matrices in the application of bivariate interpolation to curve implicitization
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations
- Prony's method in several variables: symbolic solutions by universal interpolation
- Early termination in sparse interpolation algorithms
- Title not available (Why is that?)
- Using Sparse Interpolation in Hensel Lifting
- Random arithmetic formulas can be reconstructed efficiently
- Amplitudes, supersymmetric black hole scattering at \(\mathcal{O}(G^5)\), and loop integration
- Efficient reduction of Feynman integrals on supercomputers
- An explicit separation of relativised random polynomial time and relativised deterministic polynomial time
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Integral reduction with Kira 2.0 and finite field methods
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
- Solutions of systems of algebraic equations and linear maps on residue class rings
- Sparse polynomial interpolation based on diversification
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
- Fairness in temporal slot assignment
- On the evaluation of some sparse polynomials
- Solving structured linear systems with large displacement rank
- Faster sparse multivariate polynomial interpolation of straight-line programs
- The complexity of sparse polynomial interpolation over finite fields
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Results and techniques for higher order calculations within the gradient-flow formalism
- Sparse polynomial interpolation based on derivatives
- On the decidability of sparse univariate polynomial interpolation
This page was built for publication: Interpolating polynomials from their values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915342)
