Pages that link to "Item:Q1914164"
From MaRDI portal
The following pages link to Computing GCDs of polynomials over algebraic number fields (Q1914164):
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)
- Good reduction of Puiseux series and applications (Q654032) (← links)
- Interval arithmetic in cylindrical algebraic decomposition (Q1864882) (← links)
- The use of bad primes in rational reconstruction (Q5501158) (← links)
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings (Q6159541) (← links)
