Fast reduction of ternary quadratic forms

DOI10.1007/3-540-44670-2_4MaRDI QIDQ4787197zbMATH OpenFDO

Authors Friedrich Eisenbrand, Günter Rote

Publication date 9 January 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2146/21460032, http://infoscience.epfl.ch/record/121618

zbMATH Keywords

algorithmlattice basis reductionpositive definite integral ternary formshortest vector computationternary form reduction

Mathematics Subject Classification ID

Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1273650
• A 3-dimensional lattice reduction algorithm
• Solving quadratic equations using reduced unimodular quadratic forms
• Reduction of lattice bases for arbitrary norms
• scientific article; zbMATH DE number 3970841

Cited in

(9)

• A diophantine algorithm and a reduction theory of ternary forms
• Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
• Computing Igusa class polynomials
• Fast simplifications for Tarski formulas
• scientific article; zbMATH DE number 3849336 (Why is no real title available?)
• scientific article; zbMATH DE number 4110785 (Why is no real title available?)
• scientific article; zbMATH DE number 1273650 (Why is no real title available?)
• Dirichlet’s proof of the three-square theorem: An algorithmic perspective
• Solving quadratic equations using reduced unimodular quadratic forms

This page was built for publication: Fast reduction of ternary quadratic forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787197)