Integer relation algorithm: Difference between revisions

Revision as of 15:27, 12 April 2013

Revision as of 04:27, 2 May 2013

Line 27:

The same applications can also be done with the LLL algorithm. Recent versions of LLL can handle problems with n above 500.

== References ==

{{reflist|colwidth=30em}}

== External links ==

* [http://oldweb.cecm.sfu.ca/organics/papers/bailey/paper/html/paper.html ''Recognizing Numerical Constants''] by [[David H. Bailey]] and [[Simon Plouffe]]

* [http://crd.lbl.gov/~dhbailey/dhbpapers/tenproblems.pdf ''Ten Problems in Experimental Mathematics''] by David H. Bailey, [[Jonathan Borwein|Jonathan M. Borwein]], Vishaal Kapoor, and [[Eric W. Weisstein]]

* Jingwei Chen, Damien Stehlé, Gilles Villard: ''[http://perso.ens-lyon.fr/damien.stehle/downloads/PSLQHJLS.pdf A New View on HJLS and PSLQ: Sums and Projections of Lattices.''] accepted for [http://www.issac-conference.org/2013/ ISSAC'13]

{{number theoretic algorithms}}