Entry Hartmanis:1988:CCM from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@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",
}
Related entries
- class,
35(1)17,
35(2)313,
37(2)123,
38(2)143,
38(2)157,
39(2)267,
40(1)57,
41(1)105,
42(2)123,
43(2)213,
44(2)237,
46(2)313,
47(1)1,
47(1)39,
47(1)71,
47(1)99,
47(2)111,
47(2)131,
47(3)247,
47(3)263,
48(2)145,
48(2)329,
52(3)177,
52(3)251,
54(1)87,
60(3)255,
61(1)17,
61(2)103,
63(1)43,
64(2)203,
67(1)75,
67(1)99,
67(2)143,
67(2)283,
68(2)155
- complete,
35(2)245,
37(1)1,
38(1)55,
38(2)157,
38(2)249,
40(2)85,
41(2)141,
42(2)123,
43(2)189,
44(2)199,
44(3)275,
45(1)1,
46(2)319,
47(1)1,
47(1)27,
47(2)169,
52(3)177,
54(2)199,
56(2)211,
57(2)317,
63(1)43,
63(3)239,
64(1)125,
65(3)343,
67(2)203,
67(2)303,
68(1)37,
68(3)267
- counting,
36(2)345,
43(2)169,
47(2)131,
49(2)283,
58(1)81,
62(1)187
- intersection,
35(2)261,
38(1)55,
45(2)121,
49(2)267,
49(2)z,
56(2)211,
58(1)69,
59(1)181,
66(2)157
- Metatheory,
57(0)3,
58(0)3,
58(1)209,
59(0)3,
59(1)25,
59(1)85,
59(1)115,
59(1)181,
59(3)211,
59(3)235,
59(3)287,
59(3)317,
60(3)231,
60(3)255,
60(3)297,
61(2)103,
61(2)199,
62(3)289,
62(3)311,
62(3)319,
63(1)1,
63(1)19,
63(1)43,
63(1)91,
63(2)113,
63(2)203,
63(3)239,
63(3)253,
63(3)275,
63(3)303,
63(3)333,
64(1)1,
64(1)15,
64(1)25,
64(1)55,
64(1)67,
64(1)97,
64(1)119,
64(3)221,
64(3)271,
64(3)281,
64(3)305,
64(3)331,
64(3)343,
65(0)123,
65(1)1,
65(1)35,
65(1)85,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)243,
65(2)249,
65(2)265,
65(3)271,
65(3)291,
65(3)343,
66(0)117,
66(2)205,
67(1)19,
67(1)87
- np,
63(1)43,
63(3)239
- probabilistic,
38(1)69,
40(1)57,
41(2)325,
49(2)267,
52(3)269,
53(1)67,
53(1)z,
54(1)65,
57(0)3,
57(1)87,
58(1)263,
62(3)251,
66(3)333