Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm
From MaRDI portal
Publication:4210097
DOI10.1137/S0097539795295626zbMath0914.11063MaRDI QIDQ4210097
No author found.
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Distributed algorithms (68W15)
Related Items (2)
Towards faster polynomial-time lattice reduction ⋮ Fast reduction of algebraic lattices over cyclotomic fields
This page was built for publication: Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm