scientific article; zbMATH DE number 3980478

zbMATH Open0606.68033MaRDI QIDQ3745271FDOQ3745271

Authors Bettina Helfrich, Jeffrey C. Lagarias, Johan Hastad, Claus Peter Schnorr

Publication date 1986

zbMATH Keywords

computational number theorylattice basis reduction algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Lattices and convex bodies (number-theoretic aspects) (11H06) Software, source code, etc. for problems pertaining to number theory (11-04)

Recommendations

• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• scientific article; zbMATH DE number 17811
• scientific article; zbMATH DE number 45475
• Integer Relations Among Algebraic Numbers
• Analysis of PSLQ, an integer relation finding algorithm

Cited in

(14)

• On computations with integer division
• Algebraic tableau reasoning for the description logic \(\mathcal{SHOQ}\)
• A modification of the LLL reduction algorithm
• La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász
• Two variants of HJLS-PSLQ with applications
• scientific article; zbMATH DE number 17811 (Why is no real title available?)
• A hierarchy of polynomial time lattice basis reduction algorithms
• A Short Proof of the Existence of Vector Euclidean Algorithms
• On the limits of computations with the floor function
• A noninductive GL(n, Z) algorithm that constructs integral linear relations for n Z-linearly dependent real numbers
• A new view on HJLS and PSLQ: sums and projections of lattices
• Numerical results on relations between fundamental constants using a new algorithm
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• A polynomial-time algorithm for finding zero-sums.

This page was built for publication:

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