Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752): 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: Magma / rank | |||
Normal rank | |||
Revision as of 03:10, 29 February 2024
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
Puiseux series
0 references
complexity
0 references
algebraic functions
0 references
