Interpolating polynomials from their values
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3942888 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- scientific article; zbMATH DE number 3528170 (Why is no real title available?)
- An Improved Multivariate Polynomial Factoring Algorithm
- Approximate formulas for some functions of prime numbers
- Factoring Multivariate Polynomials Over the Integers
- Factoring sparse multivariate polynomials
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Irreducibility of multivariate polynomials
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
Cited in
(52)- Sparse multiplication of multivariate linear differential operators
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- The complexity of sparse Hensel lifting and sparse polynomial factorization
- scientific article; zbMATH DE number 6469260 (Why is no real title available?)
- Integral reduction with Kira 2.0 and finite field methods
- Implicitization of curves and (hyper)surfaces using predicted support
- One loop QCD corrections to \(gg\rightarrow t\bar{t}H\) at \(\mathcal{O}(\epsilon^2)\)
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
- Black-box polynomial resultants
- Exploring crypto dark matter: new simple PRF candidates and their applications
- A fast parallel sparse polynomial GCD algorithm
- Foreword
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
- An effective hybrid algorithm for computing symbolic determinants
- Using sparse interpolation in Hensel lifting
- Amplitudes, supersymmetric black hole scattering at \(\mathcal{O}(G^5)\), and loop integration
- The complexity of sparse polynomial interpolation over finite fields
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
- Efficient reduction of Feynman integrals on supercomputers
- Sparse polynomial interpolation based on diversification
- An explicit separation of relativised random polynomial time and relativised deterministic polynomial time
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
- Sparse polynomial interpolation based on derivatives
- An interpolation algorithm for computing Dixon resultants
- Prony's method in several variables: symbolic solutions by universal interpolation
- On the decidability of sparse univariate polynomial interpolation
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Structured matrices in the application of bivariate interpolation to curve implicitization
- On the evaluation of some sparse polynomials
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Reconstructing rational functions with \texttt{FireFly}
- Sparse shifts for univariate polynomials
- Incremental delay enumeration: space and time
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly}
- Fairness in temporal slot assignment
- Results and techniques for higher order calculations within the gradient-flow formalism
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Early termination in sparse interpolation algorithms
- Interpolation polynomials. Application in findingsome combinatorial formulas
- Sparse polynomial interpolation by variable shift in the presence of noise and outliers in the evaluations
- A New Black Box Factorization Algorithm - the Non-monic Case
- Solving structured linear systems with large displacement rank
- On the complexities of multipoint evaluation and interpolation
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Using sparse interpolation to solve multivariate Diophantine equations
- Balancing act: multivariate rational reconstruction for IBP
- Reconstructing Algebraic Functions from Mixed Data
- Random arithmetic formulas can be reconstructed efficiently
- Solutions of systems of algebraic equations and linear maps on residue class rings
- On learning multivariate polynomials under the uniform distribution
- Interpolation of polynomials given by straight-line programs
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)
