Revision as of 23:02, 3 February 2014 edit MvH (talk \| contribs) Extended confirmed users 706 edits →History ← Previous edit		Revision as of 23:28, 3 February 2014 edit undo MvH (talk \| contribs) Extended confirmed users 706 edits →Applications: added factoring Next edit →
Line 22: Integer relation algorithms are combined with tables of high precision mathematical constants and heuristic search methods in applications such as the [[Inverse Symbolic Calculator]] or [[Plouffe's Inverter]]. Modern versions of LLL can solve integer relation problems with ''n'' above 500. Integer relation finding can be used factor polynomials over the rationals of high degree<ref>M. van Hoeij: ''Factoring polynomials and the knapsack problem.'' J. of Number Theory, 95, 167-189, (2002).</ref>. ~~The same applications can also be done with the LLL algorithm. Recent versions of LLL can handle problems with n above 500.~~ == References ==

Integer relation algorithm: Difference between revisions