The Complexity of Solving Polynomial Equations by Prime Root Extractions

DOI10.1137/0604010zbMath0509.12023OpenAlexW2072538628MaRDI QIDQ4748234

Georg Gati

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604010

zbMATH Keywords

complexityinverse Galois theorylower boundspolynomial equationscyclotomic polynomialssolvable by radicalsbinomial equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Galois theory (11R32) Equations in general fields (12E12) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• The Complexity of Solving Polynomial Equations by Quadrature
• Unnamed Item
• Unnamed Item

This page was built for publication: The Complexity of Solving Polynomial Equations by Prime Root Extractions