scientific article; zbMATH DE number 3980478

zbMATH Open0606.68033MaRDI QIDQ3745271FDOQ3745271

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

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (12)

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

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)