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 10 items.
- On computation of the greatest common divisor of several polynomials over a finite field. (Q1414018) (← links)
- Simultaneous elimination by using several tools from real algebraic geometry (Q1808663) (← links)
- Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials (Q2564953) (← links)
- On the greatest common divisor of two univariate polynomials. II (Q2717616) (← links)
- Irreducibility and greatest common divisor algorithms for sparse polynomials (Q3166375) (← links)
- Nikolai Ivanovich Lobachevskii (on the bicentenary of his birth) (Q4300572) (← links)
- (Q4375622) (← links)
- Certified Hermite Matrices from Approximate Roots - Univariate Case (Q5014656) (← links)
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter (Q5930921) (← links)
