Revision as of 13:03, 22 December 2013 edit LutzL (talk \| contribs) Extended confirmed users 1,187 edits →References: Added reference to Lehmers original paper and to an algorithm reflecting the content of the article ← Previous edit		Revision as of 13:05, 22 December 2013 edit undo LutzL (talk \| contribs) Extended confirmed users 1,187 edits →External links Next edit →
Line 56: ==External links== * [https://svn.ece.lsu.edu/svn/dmk/trunk/benchmarks/simtools/scpu2k/gap/polystff.g GAP Library, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany] * [[Jan van Leeuwen]] (January 1979): [http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-01.pdf "On program efficiency and algebraic complexity"] (or: how to compute the Schur transform of a complex polynomial). technical report RUU-CS-79~1. Department of Computer Science, ~~[[Jan~~University ~~van~~of ~~Leeuwen]]~~Utrecht {{DEFAULTSORT:Lehmer-Schur Algorithm}}

Lehmer–Schur algorithm: Difference between revisions