On polynomials with symmetric Galois group which are easy to compute
From MaRDI portal
Publication:1098889
DOI10.1016/0304-3975(86)90137-4zbMath0637.12013MaRDI QIDQ1098889
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90137-4
Hilbertian field; complexity class; symmetric Galois group; Ostrowski's complexity measure for evaluating polynomials
68Q25: Analysis of algorithms and problem complexity
12F10: Separable extensions, Galois theory
12E05: Polynomials in general fields (irreducibility, etc.)
12-04: Software, source code, etc. for problems pertaining to field theory
Related Items
On the algebraic complexity of rational iteration procedures, Fast recognition of alternating and symmetric Galois groups, Lower bounds for the complexity of polynomials
Cites Work