Entry Robson:1990:STB from tcs1990.bib
Last update: Wed Sep 26 02:11:46 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{Robson:1990:STB,
author = "J. M. Robson",
title = "Strong time bounds: non-computable bounds and a
hierarchy theorem",
journal = j-THEOR-COMP-SCI,
volume = "73",
number = "3",
pages = "313--317",
day = "22",
month = jul,
year = "1990",
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 = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Australian Nat. Univ.,
Canberra, ACT, Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computational complexity; hierarchy
theorem; non-computable bounds; RAM program; time
bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bound,
72(2)251,
74(2)121,
74(3)313,
74(3)329,
81(2)237,
82(1)19,
82(1)113,
82(1)157,
83(2)169,
85(1)155,
85(2)305,
86(2)267,
88(1)59,
91(2)265,
92(1)191,
93(2)279,
96(2)411,
97(2)233,
97(2)285,
98(2)289,
100(1)185,
100(1)223,
102(2)215,
102(2)253,
102(2)355,
106(2)221,
106(2)351,
107(1)77,
107(1)121,
108(2)251,
108(2)271,
108(2)311,
110(1)1,
112(2)355,
112(2)419,
113(1)75,
116(1)195,
116(2)305,
116(2)415,
119(2)267,
120(2)169,
121(1)279,
123(1)95,
123(1)145,
123(2)377,
123(2)389,
125(2)329,
125(2)373,
127(2)395,
128(1)63,
129(1)193,
129(2)263,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)85,
130(1)163,
130(1)175,
131(2)243,
131(2)331,
132(1)259,
132(1)377,
132(1)387,
133(1)23,
133(1)105,
134(1)189,
134(1)253,
136(2)527
- computability,
77(3)221,
80(2)203,
82(1)1,
86(2)377,
94(1)101,
97(1)1,
100(2)267,
113(2)191,
116(2)317,
119(1)187,
119(1)z,
121(1)89,
131(2)243,
132(1)113,
133(1)65,
134(2)537
- hierarchy,
80(2)203,
81(1)77,
83(1)97,
83(2)313,
83(2)323,
84(2)199,
85(2)305,
88(2)297,
91(1)71,
95(1)97,
96(2)325,
96(2)345,
97(2)183,
98(2)249,
98(2)289,
100(1)45,
101(2)289,
102(2)215,
104(2)235,
106(2)283,
112(2)339,
112(2)413,
113(1)167,
115(2)225,
115(2)261,
116(1)33,
119(2)293,
120(2)293,
123(2)239,
125(2)355,
127(1)123,
129(2)323,
132(1)1,
134(2)263,
134(2)287
- RAM,
82(1)141,
85(1)53,
95(2)323,
127(1)53,
130(1)85
- Robson, J. M.,
82(1)141,
106(2)327
- strong,
80(2)263,
83(1)3,
88(1)1,
94(1)101,
95(2)263,
99(1)121,
102(2)215,
104(2)263,
105(1)7,
107(2)333,
108(1)173,
111(1)125,
111(1)z