The Complexity of Solving Polynomial Equations by Prime Root Extractions

DOI10.1137/0604010MaRDI QIDQ4748234zbMATH OpenOpenAlexFDO

Authors 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

binomial equationscomplexitycyclotomic polynomialsinverse Galois theorylower boundspolynomial equationssolvable by radicals

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3086882 (Why is no real title available?)
• scientific article; zbMATH DE number 3091925 (Why is no real title available?)
• The Complexity of Solving Polynomial Equations by Quadrature

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4748234)