On the complexity of computing Gröbner bases in characteristic 2 (Q1336772)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of computing Gröbner bases in characteristic 2 |
scientific article; zbMATH DE number 681789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing Gröbner bases in characteristic 2 |
scientific article; zbMATH DE number 681789 |
Statements
On the complexity of computing Gröbner bases in characteristic 2 (English)
0 references
3 November 1994
0 references
computational complexity
0 references
analysis of algorithms
0 references
Gröbner basis
0 references
0.8104488253593445
0 references
0.7849880456924438
0 references
0.7695092558860779
0 references
