The Complexity of Solving Polynomial Equations by Quadrature

DOI10.1145/2402.322395zbMath0625.68031OpenAlexW2081142074MaRDI QIDQ3028341

Georg Gati

Publication date: 1983

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2402.322395

zbMATH Keywords

Galois theorysquare rootscomputation of roots of polynomialsproblems solvable by ruler and compasssharp lower bounds for computational complexitysolving polynomial equations by quadrature

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Galois theory (11R32)

Related Items (1)

The Complexity of Solving Polynomial Equations by Prime Root Extractions

This page was built for publication: The Complexity of Solving Polynomial Equations by Quadrature