The following pages link to Algorithmic Number Theory (Q5899246):
Displaying 9 items.
- Dynamic Galois theory (Q607055) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Computing with algebraically closed fields (Q846355) (← links)
- A modular method for computing the Galois groups of polynomials (Q1358933) (← links)
- Efficient arithmetic in successive algebraic extension fields using symmetries (Q1948674) (← links)
- Computing splitting fields using Galois theory and other Galois constructions (Q2100056) (← links)
- Finding Integral Linear Dependencies of Algebraic Numbers and Algebraic Lie Algebras (Q3091948) (← links)
- A polynomial time algorithm for computing the HNF of a module over the integers of a number field (Q5244519) (← links)
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields (Q5891054) (← links)
