On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-14518-6_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1517477680 / rank | |||
Normal rank | |||
Revision as of 01:34, 20 March 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
