Entry Hartmanis:1979:RBD from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@Article{Hartmanis:1979:RBD,
author = "J. Hartmanis",
title = "Relations between diagonalization, proof systems, and
complexity gaps",
journal = j-THEOR-COMP-SCI,
volume = "8",
number = "2",
pages = "239--253",
month = apr,
year = "1979",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity gaps; computational complexity;
diagonalization; proof systems; time bounded
computations; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- automata,
1(1)77,
1(2)95,
1(4)269,
1(4)297,
1(4)317,
2(1)1,
2(1)29,
2(1)49,
2(1)115,
2(2)147,
2(2)155,
2(3)271,
3(2)173,
3(2)213,
3(2)243,
3(2)261,
3(3)305,
4(2)143,
4(3)245,
5(2)101,
5(2)183,
6(1)1,
6(1)25,
6(2)175,
7(1)25,
7(2)149,
7(2)185,
7(3)311,
7(3)333,
8(2)227,
8(2)255,
9(1)127,
9(1)141,
9(2)221,
9(2)311,
9(2)385
- bounded,
1(2)103,
2(1)49,
3(2)213,
3(3)273
- C4220,
1(1)77,
1(2)95,
1(4)269,
1(4)297,
1(4)317,
2(1)1,
2(1)29,
2(1)49,
2(1)115,
2(2)147,
2(2)155,
2(3)271,
3(2)173,
3(2)213,
3(2)243,
3(2)261,
3(3)305,
4(2)143,
4(3)245,
5(2)101,
5(2)183,
6(1)1,
6(1)25,
6(2)175,
7(2)149,
7(2)185,
7(3)311,
7(3)333,
8(2)227,
8(2)255,
9(1)127,
9(1)141,
9(2)221,
9(2)311
- complexity,
1(1)13,
1(1)21,
1(1)59,
1(2)103,
1(2)161,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(3)305,
2(3)383,
2(3)397,
3(1)1,
3(1)23,
3(1)105,
3(2)213,
3(2)267,
3(3)305,
3(3)349,
4(1)23,
4(2)171,
4(3)277,
5(2)205,
6(1)41,
6(1)93,
6(2)223,
6(3)233,
6(3)317,
7(1)79,
7(1)99,
7(3)273,
8(2)189,
8(2)203,
8(2)227,
8(2)255,
9(1)83,
9(1)127
- computation,
1(4)289,
2(3)305,
4(2)235,
5(2)205,
5(3)321,
6(1)41,
7(1)1,
7(2)127,
7(3)239,
8(2)189,
8(2)227,
9(1)147,
9(2)311
- computational,
1(1)13,
1(1)21,
1(2)103,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(3)305,
2(3)397,
3(1)1,
3(1)23,
3(1)105,
3(2)267,
3(3)305,
3(3)349,
4(1)23,
4(3)277,
5(2)205,
6(1)41,
6(1)93,
6(2)223,
6(3)233,
6(3)317,
7(1)79,
7(1)99,
7(3)273,
8(2)189,
8(2)203,
8(2)227,
8(2)255,
9(1)17,
9(1)83,
9(1)127
- Hartmanis, J.,
3(2)213,
7(3)273
- machine,
1(1)77,
1(2)125,
1(4)269,
1(4)297,
2(1)1,
2(1)73,
2(2)183,
2(3)345,
3(2)213,
3(3)305,
6(1)1,
6(1)25,
6(2)175,
7(2)185,
7(3)311,
8(2)227,
9(1)127
- proof,
2(2)183,
3(2)267,
5(2)135,
8(2)261,
9(2)329,
9(2)347
- relation,
2(2)147,
3(2)243,
5(3)325,
9(1)127
- system,
1(1)59,
1(4)325,
1(4)331,
2(1)9,
2(1)49,
2(1)77,
2(3)317,
3(1)75,
3(2)173,
4(2)171,
5(1)25,
5(1)51,
5(3)339,
6(2)223,
6(3)327,
7(1)117,
7(2)169,
7(3)287,
8(2)135,
8(3)293,
8(3)379,
9(2)207,
9(2)265,
9(2)329,
9(2)363,
9(2)377
- time,
1(2)103,
1(3)215,
1(4)269,
3(1)1,
3(1)23,
3(1)61,
3(1)105,
3(3)305,
6(1)93,
7(2)149,
7(2)185,
7(3)273,
8(1)45,
8(2)189
- Turing,
1(1)77,
1(2)103,
1(3)215,
2(1)73,
3(2)213,
6(1)1,
6(1)25,
6(2)175,
7(2)185,
8(2)227,
9(1)127,
9(2)311