Pages that link to "Item:Q5414599"

The following pages link to On the Lattice Isomorphism Problem (Q5414599):

Displaying 11 items.

• The complexity of the covering radius problem (Q814418) (← links)
• A note on the distribution of the distance from a lattice (Q1006407) (← links)
• Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
• Linear discrepancy is \(\Pi_2\)-hard to approximate (Q2234789) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• Covering radius of two-dimensional lattices (Q2858312) (← links)
• Complexity and algorithms for computing Voronoi cells of lattices (Q3055167) (← links)
• The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
• New Results on the Remote Set Problem and Its Applications in Complexity Study (Q6489321) (← links)
• Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)