The following pages link to (Q4375605):
Displaying 23 items.
- A generalization of reduced Arakelov divisors of a number field (Q290021) (← links)
- A method for finding a minimal point of the lattice in cubic number fields (Q407376) (← links)
- Efficient computation of maximal orders in radical (including Kummer) extensions (Q412222) (← links)
- Construction of a Hermitian lattice without a basis of minimal vectors (Q444755) (← links)
- A generalization of the LLL-algorithm over Euclidean rings or orders (Q679101) (← links)
- Reduced bases of lattices over number fields (Q1196257) (← links)
- Lattices of compatibly embedded finite fields (Q1369796) (← links)
- On validated computing in algebraic number fields (Q1382030) (← links)
- Lattice reductions over Euclidean rings with applications to cryptanalysis (Q1744870) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Lattices, Diophantine equations and applications to rational surfaces (Q2392943) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Lamps, Factorizations, and Finite Fields (Q2757477) (← links)
- Lattices Over Eisenstein Integers for Compute-and-Forward (Q2977212) (← links)
- (Q3199502) (← links)
- (Q4941082) (← links)
- Counting Bounded Elements of a Number Field (Q5022118) (← links)
- Root lattices in number fields (Q5027009) (← links)
- Bases of minimal vectors in tame lattices (Q5046063) (← links)
- Algorithms for computing maximal lattices in bilinear (and quadratic) spaces over number fields (Q5167418) (← links)
- (Q5192494) (← links)
- Lattice point counting and height bounds over number fields and quaternion algebras (Q5494782) (← links)
- Subfield algorithms for ideal- and module-SVP based on the decomposition group (Q6196952) (← links)
