Pages that link to "Item:Q915342"
From MaRDI portal
The following pages link to Interpolating polynomials from their values (Q915342):
Displaying 50 items.
- Black-box polynomial resultants (Q286994) (← links)
- On learning multivariate polynomials under the uniform distribution (Q290214) (← links)
- Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- On the decidability of sparse univariate polynomial interpolation (Q685722) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Structured matrices in the application of bivariate interpolation to curve implicitization (Q870441) (← links)
- An explicit separation of relativised random polynomial time and relativised deterministic polynomial time (Q918200) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries (Q990537) (← links)
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- An effective hybrid algorithm for computing symbolic determinants (Q1044418) (← links)
- Solutions of systems of algebraic equations and linear maps on residue class rings (Q1201351) (← links)
- The complexity of sparse polynomial interpolation over finite fields (Q1320441) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials (Q1686837) (← links)
- A modular method to compute the rational univariate representation of zero-dimensional ideals (Q1808670) (← links)
- Early termination in sparse interpolation algorithms (Q1878478) (← links)
- Sparse shifts for univariate polynomials (Q1924546) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? (Q2000529) (← links)
- An interpolation algorithm for computing Dixon resultants (Q2109984) (← links)
- Sparse polynomial interpolation based on diversification (Q2143469) (← links)
- Sparse polynomial interpolation based on derivatives (Q2156377) (← links)
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs (Q2188992) (← links)
- Incremental delay enumeration: space and time (Q2274091) (← links)
- The complexity of sparse Hensel lifting and sparse polynomial factorization (Q2284969) (← links)
- Results and techniques for higher order calculations within the gradient-flow formalism (Q2314968) (← links)
- Prony's method in several variables: symbolic solutions by universal interpolation (Q2399865) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- Reconstructing rational functions with \texttt{FireFly} (Q2698810) (← links)
- Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations (Q2799561) (← links)
- Using Sparse Interpolation in Hensel Lifting (Q2830017) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- On the evaluation of some sparse polynomials (Q4600715) (← links)
- Using sparse interpolation to solve multivariate diophantine equations (Q5270178) (← links)
- (Q5501379) (← links)
- Symbolic-numeric sparse interpolation of multivariate polynomials (Q5902083) (← links)
- Foreword (Q5918134) (← links)
- A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)
- Fairness in temporal slot assignment (Q6109542) (← links)
- Integral reduction with Kira 2.0 and finite field methods (Q6156526) (← links)
- Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly} (Q6161965) (← links)
- Balancing act: multivariate rational reconstruction for IBP (Q6173579) (← links)
- One loop QCD corrections to \(gg\rightarrow t\bar{t}H\) at \(\mathcal{O}(\epsilon^2)\) (Q6552361) (← links)
- Amplitudes, supersymmetric black hole scattering at \(\mathcal{O}(G^5)\), and loop integration (Q6647346) (← links)
- Efficient reduction of Feynman integrals on supercomputers (Q6649047) (← links)
