A pommaret division algorithm for computing Grobner bases in boolean rings (Q5301609)
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: A pommaret division algorithm for computing Grobner bases in boolean rings |
scientific article; zbMATH DE number 5493983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A pommaret division algorithm for computing Grobner bases in boolean rings |
scientific article; zbMATH DE number 5493983 |
Statements
A pommaret division algorithm for computing Grobner bases in boolean rings (English)
0 references
20 January 2009
0 references
0.9370060563087464
0 references
0.8770076632499695
0 references
0.8561156392097473
0 references
0.8409621715545654
0 references
0.8399650454521179
0 references
