Dear Team,
at SD 10, Martin Albrecht and I implemented the F5 algorithm according
to John Perry's pseudocode. The two implementations are at
http://wiki.sagemath.org/days10/CodingSprint
attachment f5.py (Martin's pure python implementation) respectively
f5.pyx (my cython implementation).
These are only toy implementations that clearly can't compete with
Singular:
f5.pyx f5.py
Cyclic-6 8.78s 22.44s
Katsura-5 lex 93.85s 428.52s
Katsura-7 degrevlex 4.21s 7.86s
Nevertheless: There already is a toy implementation of Buchberger's
algorithm in Sage. So, do you think the toy-F5 shall be included as
well?
If "yes", what is needed to do?
Cheers
Simon
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
