HAL (France)
open access
The algebraic lattice isomorphism problem
The Lattice Isomorphism Problem (LIP) asks whether two Euclidean lattices are isometric, and, if so, asks to compute such an isometry. This problem has been studied for several decades from an algorithmic point of view. Known methods rely, in particular, on computing short vectors in both lattices,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Automorphisms and canonical forms of integer lattices#1341638
- On hyperbolic lattices whose reduced automorphism group is virtually abelian#1156197
- Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points#1013523
- Polycyclic groups and profinite isomorphism#1325165
- Algorithms for Finite Group Epimorphism Testing#984353
Record · ID 1367011
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive