On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Maple / rank | |||
Normal rank | |||
Revision as of 04:12, 29 February 2024
scientific article; zbMATH DE number 5793679
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of the Montes Ideal Factorization Algorithm |
scientific article; zbMATH DE number 5793679 |
Statements
On the Complexity of the Montes Ideal Factorization Algorithm (English)
0 references
29 September 2010
0 references
complexity of polynomial factorization
0 references
Montes ideal factorization algorithm
0 references
