Pages that link to "Item:Q3975185"
From MaRDI portal
The following pages link to An asymptotically fast probabilistic algorithm for computing polynomial GCD's over an algebraic number field (Q3975185):
Displaying 7 items.
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation (Q1124635) (← links)
- Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209) (← links)
- On degrees of modular common divisors and the big prime gcd algorithm (Q1751453) (← links)
- Directed evaluation (Q2192677) (← links)
- On Dynamic Algorithms for Algebraic Problems (Q3128199) (← links)
- Algorithms for polynomial GCD computation over algebraic function fields (Q4657339) (← links)
- Computing the non-properness set of real polynomial maps in the plane (Q6672004) (← links)