Pages that link to "Item:Q5096342"
From MaRDI portal
The following pages link to On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342):
Displaying 3 items.
- Simultaneous elimination by using several tools from real algebraic geometry (Q1808663) (← links)
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials (Q2564953) (← links)
- Certified Hermite Matrices from Approximate Roots - Univariate Case (Q5014656) (← links)
