Algorithmic proofs of two theorems of Stafford. (Q2643577)
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: Algorithmic proofs of two theorems of Stafford. |
scientific article; zbMATH DE number 5182731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic proofs of two theorems of Stafford. |
scientific article; zbMATH DE number 5182731 |
Statements
Algorithmic proofs of two theorems of Stafford. (English)
0 references
24 August 2007
0 references
Weyl algebras
0 references
\(D\)-modules
0 references
Gröbner bases
0 references
minimal generation
0 references
0.8292331099510193
0 references
0.8158425092697144
0 references
0.8144106268882751
0 references
0.7891837358474731
0 references
