Probabilistic algorithms for computing resultants

DOI10.1145/1073884.1073919zbMath1360.68946OpenAlexW2039221798MaRDI QIDQ5262771

Michael B. Monagan

Publication date: 16 July 2015

Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.5440

zbMATH Keywords

probabilistic algorithmsSylvester's resultantmodular algorithmspolynomial resultants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Related Items (3)

Computational schemes for subresultant chains ⋮ Parallelization of triangular decompositions: techniques and implementation ⋮ Fast norm computation in smooth-degree abelian number fields

Uses Software

• Maple

This page was built for publication: Probabilistic algorithms for computing resultants