Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Hartmanis:1988:CCM,
author = "Juris Hartmanis and Lane A. Hemachandra",
title = "Complexity classes without machines: On complete
languages for {UP}",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "129--142",
month = jun,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ",
affiliationaddress = "Ithaca, NY, USA",
classification = "721; 723; C4210 (Formal logic); C4240 (Programming
and algorithm theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Complete Languages; complete
languages; Complexity Classes; complexity classes;
computational complexity; Computer Metatheory;
counting; Counting Class up; counting classes; Formal
Languages; formal languages; intersection classes; np
Languages; probabilistic classes; UP",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}