Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Homer:1987:HPD,
author = "S. Homer and T. J. Long",
title = "Honest polynomial degrees and {P=?NP}",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "265--280",
month = "????",
year = "1987",
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 = "Dept. of Comput. Sci., Boston Univ., MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computational complexity; honest
polynomial degrees; honest polynomial-time Turing
reducibility; minimal; nonrecursive sets; set theory;
tally sets",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}