On the Lattice Isomorphism Problem

DOI10.4086/cjtcs.2012.004zbMath1286.68192arXiv1311.0366OpenAlexW4237419163MaRDI QIDQ5414599

Ishay Haviv, Oded Regev

Publication date: 6 May 2014

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.0366

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ The Reductions for the Approximating Covering Radius Problem ⋮ Linear discrepancy is \(\Pi_2\)-hard to approximate ⋮ Complexity and algorithms for computing Voronoi cells of lattices ⋮ A note on the distribution of the distance from a lattice ⋮ Computing the covering radius of a polytope with an application to lonely runners ⋮ The remote set problem on lattices

This page was built for publication: On the Lattice Isomorphism Problem