First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
RSS
Sort by »
date
activity
answers ▼
votes
1
question
Tagged
64bit
×
finite-field
×
PolynomialRing
×
groebner_basis
×
348
views
no
answers
2
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
64bit
×1
finite-field
×1
groebner_basis
×1
PolynomialRing
×1
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.
Powered by Askbot version 0.7.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how
dummy
×