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 6 items.
- 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)
- Detecting algebraic curves in bad position (Q5937884) (← links)
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings (Q6159541) (← links)
