Recommendations
- scientific article; zbMATH DE number 1254255
- An algorithm for symbolic-numeric sparse interpolation of multivariate polynomials whose degree bounds are unknown
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- scientific article; zbMATH DE number 1775436
- Probabilistic algorithms for computing resultants
Cites work
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Dagwood
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 1254255 (Why is no real title available?)
- scientific article; zbMATH DE number 481965 (Why is no real title available?)
- Interpolating polynomials from their values
- On the efficiency of effective Nullstellensätze
- On the intrinsic complexity of elimination theory
- Randomized Interpolation and Approximation of Sparse Polynomials
- The Calculation of Multivariate Polynomial Resultants
Cited in
(5)- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- scientific article; zbMATH DE number 3909748 (Why is no real title available?)
- scientific article; zbMATH DE number 1254255 (Why is no real title available?)
- scientific article; zbMATH DE number 1775436 (Why is no real title available?)
- The black-box query complexity of polynomial summation
This page was built for publication: Black-box polynomial resultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286994)
