Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Hartmanis:1991:OWF,
author = "J. Hartmanis",
title = "One-way functions and the nonisomorphism of
{NP-complete} sets",
journal = j-THEOR-COMP-SCI,
volume = "81",
number = "1",
pages = "155--163",
day = "22",
month = apr,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; nonisomorphism; NP-complete
sets; one-way conjecture; one-way functions;
relativized counterexample",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}