Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity bounds for the rational Newton-Puiseux algorithm over finite fields |
scientific article |
Statements
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (English)
0 references
20 June 2012
0 references
