scientific article; zbMATH DE number 1852135
From MaRDI portal
Publication:4787197
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmlattice basis reductionpositive definite integral ternary formshortest vector computationternary form reduction
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)
Related Items (3)
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
This page was built for publication:
