Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752): 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/s00200-011-0144-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050415272 / rank | |||
Normal rank | |||
Revision as of 22:43, 19 March 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
