The following pages link to (Q4375605):
Displaying 8 items.
- 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)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Bases of minimal vectors in tame lattices (Q5046063) (← links)
- Subfield algorithms for ideal- and module-SVP based on the decomposition group (Q6196952) (← links)
