Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity bounds for the rational Newton-Puiseux algorithm over finite fields |
scientific article; zbMATH DE number 6048424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity bounds for the rational Newton-Puiseux algorithm over finite fields |
scientific article; zbMATH DE number 6048424 |
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
0 references
