Hi parisse, I agree that this is a question of which algorithm is used.
Singular uses two algorithms: poly smCallDet(ideal I) which uses Bareiss and poly singclap_det(matrix m) which seems to be a multi-modular approach. The heuristic to choose between the two is implemented in smCheckDet. How fast ist Giac for this particular computation? Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _www: http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED] --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
