On polynomials with symmetric Galois group which are easy to compute
From MaRDI portal
Publication:1098889
DOI10.1016/0304-3975(86)90137-4zbMath0637.12013OpenAlexW2064613553MaRDI 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 fieldcomplexity classsymmetric Galois groupOstrowski's complexity measure for evaluating polynomials
Analysis of algorithms and problem complexity (68Q25) Separable extensions, Galois theory (12F10) Polynomials in general fields (irreducibility, etc.) (12E05) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (4)
Ewens Sampling and Invariable Generation ⋮ Lower bounds for the complexity of polynomials ⋮ Fast recognition of alternating and symmetric Galois groups ⋮ On the algebraic complexity of rational iteration procedures
Cites Work
This page was built for publication: On polynomials with symmetric Galois group which are easy to compute