A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
From MaRDI portal
(Redirected from A fast phase-based enumeration algorithm for SVP challenge through y-sparse representations of short lattice vectors)
A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.