|
Size: 306
Comment:
|
Size: 1016
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| * Simon King - [[http://sage.math.washington.edu/home/SimonKing/SAGE/How%20to%20implement%20new%20algebraic%20structures%20in%20Sage.sws | short version used at SD 35]] and [[http://sagenb.org/home/pub/3837 | original longer version]] | * Martin Albrecht - ''M4RI(E)'' [[attachment:20111219_-_M4RI_-_Warwick.pdf | slides]] * John Cremona - ''Sage as a research tool'' [[attachment:sd35.pdf | slides]] and [[http://www.sagenb.org/home/pub/3867 | worksheet]] * Bill Hart - ''FLINT'' [[attachment:flint.pdf | slides]] * Fredrik Johansson - ''Fast Special Functions'' [[attachment:flint-specfun.pdf | slides]] * Simon King - ''How to implement new algebraic structures in Sage: Sage's category and coercion framework'' [[http://sage.math.washington.edu/home/SimonKing/SAGE/How%20to%20implement%20new%20algebraic%20structures%20in%20Sage.sws | short version used here]] and [[http://sagenb.org/home/pub/3837 | original longer version]] * Andy Novocin - ''L1, a quasi-linear LLL algorithm'' [[attachment:novocin_L1.pdf | slides]] * Arne Storjohann - ''Some ideas for efficient implementation of algorithms for polynomial matrix computations'' [[attachment:talk.pdf | slides]] |
Slides, worksheets and references for talks at Sage Days 35
Martin Albrecht - M4RI(E) slides
Bill Hart - FLINT slides
Fredrik Johansson - Fast Special Functions slides
Simon King - How to implement new algebraic structures in Sage: Sage's category and coercion framework short version used here and original longer version
Andy Novocin - L1, a quasi-linear LLL algorithm slides
Arne Storjohann - Some ideas for efficient implementation of algorithms for polynomial matrix computations slides