On Tuesday 30 September 2008, David Harvey wrote: > Yeah why the hell not. > > As long as someone who understands these algorithms (me: not yet) > signs off on precision bounds etc. > > Not sure if you'll get it upstream, but you could try.
fpLLL has a wrapper class which does all that for you, i.e. it guarantees the result to be LLL reduced. Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _www: http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED] --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
