Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields (Q5301629)
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: Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields |
scientific article; zbMATH DE number 5494001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields |
scientific article; zbMATH DE number 5494001 |
Statements
Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields (English)
0 references
20 January 2009
0 references
0.92038643
0 references
0.91239774
0 references
0.88207877
0 references
0.87837327
0 references
0.8645971
0 references
0.8617346
0 references
0.8616452
0 references
0.86107075
0 references
