Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Heintz:1986:PSG,
author = "J. Heintz",
title = "On polynomials with symmetric {Galois} group which are
easy to compute",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "99--105",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Math., J. W. Goethe-Univ., Frankfurt am
Main, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity class; computational complexity; easily
computed polynomials; hard-to-compute polynomials;
Hilbertian field; polynomials; sequence of univariate
polynomials; symmetric Galois group",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}