Publication:4787197
From MaRDI portal
zbMath1006.11080MaRDI QIDQ4787197
Friedrich Eisenbrand, Günter Rote
Publication date: 9 January 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2146/21460032
algorithm; lattice basis reduction; positive definite integral ternary form; shortest vector computation; ternary form reduction
68Q25: Analysis of algorithms and problem complexity
11Y16: Number-theoretic algorithms; complexity
11H55: Quadratic forms (reduction theory, extreme forms, etc.)
Related Items
Dirichlet’s proof of the three-square theorem: An algorithmic perspective, Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors, Computing Igusa class polynomials