Paper Info
Title
On polynomials with symmetric Galois group which are easy to compute
Abstract
We construct a sequence of univariate polynomials over an arbitrary Hilbertian field which are easy to compute and have symmetric Galois group. As a consequence we obtain that in any complexity class almost all polynomials have symmetric Galois group. All factors of such polynomials with suitable degree and coefficients from the decomposition field are hard to compute.
Year
DOI
Venue
1986
10.1016/0304-3975(86)90137-4
Theor. Comput. Sci.
Keywords
DocType
Volume
symmetric Galois group
Journal
47
Issue
ISSN
Citations 
1
Theoretical Computer Science
4
PageRank 
References 
Authors
0.67
3
1
Name
Order
Citations
PageRank
J. Heintz116219.20