Pages that link to "Item:Q1914164"
From MaRDI portal
The following pages link to Computing GCDs of polynomials over algebraic number fields (Q1914164):
Displaying 18 items.
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- Polynomial GCD derived through monic polynomial subtractions (Q420250) (← links)
- The computation of polynomial greatest common divisors over an algebraic number field (Q582076) (← links)
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
- Good reduction of Puiseux series and applications (Q654032) (← links)
- Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209) (← links)
- A subspace method for the computation of the GCD of polynomials (Q1361353) (← 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)
- Interval arithmetic in cylindrical algebraic decomposition (Q1864882) (← links)
- An asymptotically fast probabilistic algorithm for computing polynomial GCD's over an algebraic number field (Q3975185) (← links)
- (Q4250163) (← links)
- Algorithms for polynomial GCD computation over algebraic function fields (Q4657339) (← links)
- Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932) (← links)
- The use of bad primes in rational reconstruction (Q5501158) (← links)
- Fundamentals of Computation Theory (Q5900790) (← links)
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings (Q6159541) (← links)
- A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions (Q6660313) (← links)
