Probabilistic algorithms for computing resultants
From MaRDI portal
Recommendations
Cited in
(15)- Multipolynomial resultant algorithms
- Linear recurring sequences for computing the resultant of multivariate polynomials
- Improved algorithms for computing determinants and resultants
- Fast computation of generic bivariate resultants
- Space saving calculation of symbolic resultants
- Parallelization of triangular decompositions: techniques and implementation
- Black-box polynomial resultants
- A fast algorithm for computing the truncated resultant
- scientific article; zbMATH DE number 3854291 (Why is no real title available?)
- scientific article; zbMATH DE number 1507353 (Why is no real title available?)
- Fraction-free computation of the unit-circle resultant with any singularity profile
- On computing the resultant of generic bivariate polynomials
- Fast norm computation in smooth-degree abelian number fields
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Computational schemes for subresultant chains
This page was built for publication: Probabilistic algorithms for computing resultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262771)