The following pages link to (Q3327715):
Displaying 17 items.
- Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields (Q449717) (← links)
- Optimal algorithm for algebraic factoring (Q676848) (← links)
- Factoring polynomials over global fields (Q1032662) (← links)
- On the normalization of numbers and functions defined by radicals (Q1394941) (← links)
- Factoring polynomials over global fields. I (Q2456562) (← links)
- A relative van Hoeij algorithm over number fields (Q2643532) (← links)
- Polynomial factorization algorithms over number fields (Q2643570) (← links)
- Lamps, Factorizations, and Finite Fields (Q2757477) (← links)
- (Q3199502) (← links)
- (Q4375605) (← links)
- (Q4941082) (← links)
- Root lattices in number fields (Q5027009) (← links)
- An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers (Q5121132) (← links)
- Algorithms for computing maximal lattices in bilinear (and quadratic) spaces over number fields (Q5167418) (← links)
- Algebraic factoring and geometry theorem proving (Q5210786) (← links)
- Newton polygons of higher order in algebraic number theory (Q5388828) (← links)
- On the smallest ratio problem of lattice bases (Q6666549) (← links)
