An optimal, stable continued fraction algorithm for arbitrary dimension

DOI10.1007/3-540-61310-2_3zbMath1415.90066OpenAlexW1626171402MaRDI QIDQ4645911

Carsten Rössner, Claus Peter Schnorr

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hebis:30-12463

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Error analysis of QR decompositions by Givens transformations
• The Jacobi-Perron algorithm its theory and application
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• On the rapid computation of various polylogarithmic constants
• Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
• Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions
• Block Reduced Lattice Bases and Successive Minima

This page was built for publication: An optimal, stable continued fraction algorithm for arbitrary dimension