Entry Niedermeier:1998:UCL from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Niedermeier:1998:UCL,
author = "Rolf Niedermeier and Peter Rossmanith",
title = "Unambiguous computations and locally definable
acceptance types",
journal = j-THEOR-COMP-SCI,
volume = "194",
number = "1--2",
pages = "137--161",
day = "10",
month = mar,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:39 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=194&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/194/1-2/2541.pdf",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240C (Computational
complexity)",
conftitle = "Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA '95) (papers in summary form
only received)",
corpsource = "Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ.,
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acceptance types; alternation; complexity classes;
computational complexity; locally definable;
nondeterministic Turing machines; polynomial-time
bounded NTMs; promise hierarchies; Turing machines;
unambiguous oracle",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acceptance,
148(2)207,
161(1)191,
174(1)1
- alternation,
180(1)139,
180(1)229,
195(2)133,
198(1)99
- bounded,
137(1)3,
139(1)131,
148(1)93,
151(1)163,
163(1)177,
164(1)59,
164(1)287,
166(1)203,
168(1)3,
168(1)21,
169(2)201,
172(1)135,
172(1)195,
173(1)183,
175(2)309,
176(1)89,
176(1)283,
178(1)103,
181(1)141,
181(2)267,
182(1)145,
191(1)61,
193(1)53,
193(1)75,
193(1)113,
194(1)247-1,
196(1)395,
204(1)11,
209(1)1
- class,
139(1)187,
140(1)179,
140(2)291,
141(1)175,
143(1)149,
144(1)251,
145(1)111,
148(2)207,
149(2)201,
149(2)299,
150(1)1,
151(2)385,
152(1)67,
152(2)251,
153(1)49,
154(1)23,
154(2)145,
154(2)307,
154(2)367,
155(1)111,
155(1)141,
155(2)447,
157(2)227,
158(1)193,
158(1)221,
158(1)361,
160(1)305,
161(1)263,
161(1)301,
161(1)307,
162(1)5,
163(1)245,
163(1)283,
164(1)287,
165(2)355,
167(1)171,
170(1)407,
172(1)43,
172(1)91,
174(1)67,
174(1)231,
174(1)269,
176(1)39,
176(1)205,
177(1)59,
177(1)139,
178(1)37,
179(1)217,
180(1)139,
180(1)155,
180(1)217,
180(1)325,
183(1)93,
185(1)159,
185(1)177,
186(1)231,
188(1)79,
188(1)101,
190(1)87,
191(1)215,
194(1)246,
195(1)33,
195(2)113,
195(2)183,
195(2)205,
197(1)247,
198(1)225,
203(1)123,
207(1)217,
209(1)225,
211(1)253,
226(1)29,
234(1)323
- definable,
154(1)67,
169(1)3
- hierarchy,
137(2)279,
139(1)131,
141(1)253,
148(1)33,
148(2)183,
148(2)207,
148(2)303,
148(2)325,
149(1)49,
154(1)23,
155(2)447,
158(1)221,
159(2)343,
161(1)205,
161(1)235,
161(1)263,
167(1)235,
174(1)231,
174(1)259,
177(1)59,
179(1)251,
181(2)229,
184(1)237,
186(1)157,
191(1)37,
191(1)97,
192(2)315,
193(1)129,
195(2)133,
198(1)99,
205(1)45,
205(1)317,
207(1)89,
207(1)131,
210(1)21,
215(1)289
- locally,
134(1)51,
138(2)273,
148(2)261,
151(2)487,
161(1)157,
168(1)155,
179(1)319,
180(1)325
- nondeterministic,
139(1)27,
141(1)69,
141(1)175,
143(1)23,
143(1)123,
143(1)159,
148(2)207,
155(2)291,
159(2)271,
160(1)1,
161(1)301,
166(1)173,
174(1)269,
178(1)1,
178(1)37,
179(1)217,
189(1)1,
192(2)259,
194(1)183,
195(1)3,
198(1)99,
200(1)1,
228(1)105
- oracle,
148(2)325,
154(1)23,
157(2)227,
158(1)221,
180(1)17,
181(1)119,
185(1)129,
191(1)185
- polynomial-time,
137(1)129,
137(2)279,
141(1)109,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
181(2)229,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
196(1)131,
207(1)89
- time, polynomial-,
137(1)129,
137(2)279,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
196(1)131,
207(1)89
- Turing,
138(1)67,
143(1)123,
143(1)159,
145(1)111,
148(1)33,
148(2)325,
158(1)193,
161(1)301,
162(1)45,
168(2)215,
168(2)241,
168(2)257,
168(2)267,
168(2)303,
168(2)321,
168(2)417,
168(2)461,
168(2)z,
172(1)135,
174(1)203,
174(1)217,
180(1)139,
180(1)229,
180(1)341,
181(1)119,
182(1)159,
191(1)215,
192(2)315,
197(1)79,
210(1)217,
217(1)3,
411(31)2999
- unambiguous,
161(1)141