The Complexity of Solving Polynomial Equations by Quadrature (Q3028341)
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: Publication:3028341 |
scientific article; zbMATH DE number 4016189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Solving Polynomial Equations by Quadrature |
scientific article; zbMATH DE number 4016189 |
Statements
The Complexity of Solving Polynomial Equations by Quadrature (English)
0 references
1983
0 references
solving polynomial equations by quadrature
0 references
square roots
0 references
sharp lower bounds for computational complexity
0 references
Galois theory
0 references
computation of roots of polynomials
0 references
problems solvable by ruler and compass
0 references
0.7498835325241089
0 references
0.7498835325241089
0 references
0.7481756806373596
0 references
