LATTICES WITH SYMMETRY H. W. LENSTRA, JR. AND A. SILVERBERG Abstract. For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough s - Unimodular lattice - Document - PDFSEARCH.IO

First Page	Meta Content
	LATTICES WITH SYMMETRY H. W. LENSTRA, JR. AND A. SILVERBERG Abstract. For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough s Add to Reading List Document Date: 2014-12-31 12:23:03 Open Document File Size: 400,14 KB Share Result on Facebook IndustryTerm real-valued inner product / natural inner product / semidirect product / symmetric / finite abelian / basis reduction algorithm / satisfactory solution / inner product / deterministic polynomial-time algorithm / approximate solution / / Organization Alfred P. Sloan Foundation / U.S. Government / / Person Craig Gentry / Daniele Micciancio / H. W. LENSTRA / JR. / A. SILVERBERG IJ / Mike Szydlo / / / Position Prime Minister / / Product dihedral / / Technology main algorithm / cryptography / good algorithm / LLL basis reduction algorithm / deterministic polynomial-time algorithm / provably deterministic polynomial-time algorithm / Gentry-Szydlo algorithm / / SocialTag Lattice theory Lie groups Algebraic structures Quadratic forms Lattice Modular lattice Unimodular lattice Symbol Congruence lattice problem Abstract algebra

LATTICES WITH SYMMETRY H. W. LENSTRA, JR. AND A. SILVERBERG Abstract. For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough sAdd to Reading List