Pages that link to "Item:Q582076"
From MaRDI portal
The following pages link to The computation of polynomial greatest common divisors over an algebraic number field (Q582076):
Displaying 19 items.
- Greatest common divisors of \(u-1, v-1\) in positive characteristic and rational points on curves over finite fields (Q363241) (← links)
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
- Proper real reparametrization of rational ruled surfaces (Q631070) (← links)
- Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209) (← links)
- On computation of the greatest common divisor of several polynomials over a finite field. (Q1414018) (← links)
- On degrees of modular common divisors and the big prime gcd algorithm (Q1751453) (← links)
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238) (← links)
- Computing GCDs of polynomials over algebraic number fields (Q1914164) (← links)
- Polynomial greatest common divisor as a solution of system of linear equations (Q1992108) (← links)
- Irreducibility and greatest common divisor algorithms for sparse polynomials (Q3166375) (← links)
- An asymptotically fast probabilistic algorithm for computing polynomial GCD's over an algebraic number field (Q3975185) (← links)
- (Q4226976) (← links)
- (Q4250163) (← links)
- Algorithms for polynomial GCD computation over algebraic function fields (Q4657339) (← links)
- Parametric Greatest Common Divisors using Comprehensive Gröbner Systems (Q5119959) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
- Detecting algebraic curves in bad position (Q5937884) (← links)
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings (Q6159541) (← links)
