The following pages link to Algorithmic Number Theory (Q5899242):
Displaying 11 items.
- On the restricted Hilbert-Speiser and Leopoldt properties (Q351773) (← links)
- Exact algorithms for \(p\)-adic fields and epsilon constant conjectures (Q733352) (← links)
- Computing generators of free modules over orders in group algebras. (Q947499) (← links)
- Computing residue class rings and Picard groups of orders (Q2577535) (← links)
- Computations in Relative Algebraic K-Groups (Q3091977) (← links)
- Computing generators of free modules over orders in group algebras II (Q3094303) (← links)
- Computing the ideal class monoid of an order (Q3304706) (← links)
- COMPUTING HALL EXPONENTS IN THE FREE GROUP (Q4286024) (← links)
- Computation of lattice isomorphisms and the integral matrix similarity problem (Q5041469) (← links)
- On the computation of overorders (Q5111943) (← links)
- Computing isomorphisms between lattices (Q5118858) (← links)
