Abstract
Gauss gave an algorithm which reduces integer lattices in the two-dimensional case and finds a basis of a lattice consisting of its two successive minima. We exhibit its worst-case input configuration and then show that this worst-case input configuration generalizes the worst-case input configuration of the centered Euclidean algorithm to dimension two.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
