Euclidean algorithm and polynomial equations after Labatie
E.R. Garc\'ia Barroso, A. P{\l}oski
TL;DR
This paper revisits Labatie's method for solving polynomial equations with two variables, utilizing the Euclidean algorithm to improve understanding and application of the technique.
Contribution
It highlights and explains Labatie's effective approach, connecting it with the Euclidean algorithm for solving polynomial systems.
Findings
Demonstrates the effectiveness of Labatie's method
Provides a clear explanation of the Euclidean algorithm in this context
Enhances understanding of solving polynomial equations with two unknowns
Abstract
We recall Labatie's effective method of solving polynomial equations with two unknowns by using the Euclidean algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation