On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648)
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 5793679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.8958442
0 references
0.88790214
0 references
0.8848617
0 references
0.88032055
0 references
0.8738617
0 references
0.8729241
0 references
0.8726111
0 references
0.8715021
0 references
