Faugère's F4 and F5 algorithms: Difference between revisions

Content deleted Content added
Removed comment about Maple using an older version of FGb which limits the size of problems. Maple 2016 and newer use libmgb.
Citation bot (talk | contribs)
m Alter: journal, isbn, template type. Add: citeseerx. Removed parameters. | You can use this bot yourself. Report bugs here. | User-activated.
Line 36:
| issue = 1
| pages = 61–88
| publisher = Elsevier Science
| date = June 1999
| url = http://www-polsys.lip6.fr/~jcf/Papers/F99a.pdf
Line 45 ⟶ 44:
*[http://citeseer.ist.psu.edu/context/1885943/0 Reference to paper by Faugère describing the F4 algorithm]
-->
* {{cite journalbook
| last = Faugère
| first = J.-C.
| title = A new efficient algorithm for computing Gröbner bases without reduction to zero (F<sub>5</sub>)
| journal = Proceedings of the 2002 internationalInternational symposiumSymposium on Symbolic and algebraicAlgebraic computationComputation (ISSAC)
| pages = 75–83
| publisher = ACM Press
Line 55 ⟶ 54:
| url = http://www-polsys.lip6.fr/~jcf/Papers/F02a.pdf
| doi = 10.1145/780506.780516
| isbn = 978-1-58113-484-31
| citeseerx = 10.1.1.188.651
}}
* Till Stegers [http://wwwcsif.cs.ucdavis.edu/~stegers/diplom_stegers.pdf Faugère's F5 Algorithm Revisited] ([http://eprint.iacr.org/2006/404 alternative link]). Diplom-Mathematiker Thesis, advisor Johannes Buchmann, Technische Universität Darmstadt, September 2005 (revised April 27, 2007). Many references, including links to available implementations.