Some complexity results for prefix Gröbner bases in free monoid rings (Q846370)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5667932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some complexity results for prefix Gröbner bases in free monoid rings |
scientific article; zbMATH DE number 5667932 |
Statements
Some complexity results for prefix Gröbner bases in free monoid rings (English)
0 references
9 February 2010
0 references
algorithms
0 references
computational complexity
0 references
rewriting
0 references
Gröbner bases
0 references
free monoid rings
0 references
0.9984466433525084
0 references
0.8693351745605469
0 references
0.8304712772369385
0 references
0.7692746520042419
0 references
