Polynomial complexity algorithms for computational problems in the theory of algebraic curves (Q684961)
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: Polynomial complexity algorithms for computational problems in the theory of algebraic curves |
scientific article; zbMATH DE number 416599
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial complexity algorithms for computational problems in the theory of algebraic curves |
scientific article; zbMATH DE number 416599 |
Statements
Polynomial complexity algorithms for computational problems in the theory of algebraic curves (English)
0 references
15 September 1993
0 references
See the review in Zbl 0755.14017.
0 references
algorithm
0 references
Newton--Puiseux expansion
0 references
roots of a polynomial
0 references
Newton polygon method
0 references
polynomial complexity
0 references
polynomial-time algorithms
0 references
