Algorithmic Number Theory
From MaRDI portal
Publication:5899253
DOI10.1007/11792086zbMath1143.11336OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899253
Christoph Ludwig, Johannes A. Buchmann
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11792086
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Number-theoretic algorithms; complexity (11Y16) Relations with coding theory (11H71)
Related Items (4)
Explicit Hard Instances of the Shortest Vector Problem ⋮ Second order statistical behavior of LLL and BKZ ⋮ Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors ⋮ Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
Uses Software
This page was built for publication: Algorithmic Number Theory
