A Fast Algorithm for Computing the Truncated Resultant

DOI10.1145/2930889.2930931zbMath1362.13034arXiv1609.04259OpenAlexW2505488733MaRDI QIDQ2985846

Guillaume Moroz, Éric Schost

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.04259

zbMATH Keywords

power seriesresultanthalf-GCD

Mathematics Subject Classification ID

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

Related Items (4)

High-order lifting for polynomial Sylvester matrices ⋮ Computing the equisingularity type of a pseudo-irreducible polynomial ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one ⋮ Computing Puiseux series: a fast divide and conquer algorithm

This page was built for publication: A Fast Algorithm for Computing the Truncated Resultant