1 question

Tagged

64bit×
finite-field×
PolynomialRing×

352

views

answers

votes

2021-06-16 12:48:41 +0200 Sébastien Palcoux

Can we avoid to fall back to very slow toy implementation in the computation of Groebner basis under a finite field of large characteristic?

finite-field
groebner_basis
PolynomialRing
64bit

Contributors

Tags

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.