On 9/21/07, Martin Albrecht <[EMAIL PROTECTED]> wrote: > > On Friday 21 September 2007, David Kohel wrote: > > Since LLL and LLLGram in Magma V2.13 are written by Damien Stehle, > > using his asymptotically better algorithm. The previous version was > > not > > even mathematically correct (adhoc "improvements" or post-processing > > could destroy the LLL reduction condition). > > > > Damien provides C code under GPL and can be found on his web page: > > > > http://perso.ens-lyon.fr/damien.stehle/english.html > > > > It might take some art to decide on optimal parameters, but linking it > > into > > SAGE should provide the same asymptotic performance as in Magma. > > > > --David > > Thanks! From what I can see it is probably best to: > > (first) try the FP variants of NTL's LLL first (I overlooked those before)
These use real arithmetic "internally", I think, but do not alow real input data as in my previous posting. > (then) try Damien's fast.c implementation, also the proved version seems > interesting, given the discussions on this list. > Certainly! This would be very good. John > Thoughts? > 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] > > > > > -- John Cremona --~--~---------~--~----~------------~-------~--~----~ 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://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
