Entry Regan:1996:ISP 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{Regan:1996:ISP,
author = "Kenneth W. Regan",
title = "Index sets and presentations of complexity classes",
journal = j-THEOR-COMP-SCI,
volume = "161",
number = "1--2",
pages = "263--287",
day = "15",
month = jul,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:03 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=161&issue=1-2&aid=2087",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210L (Formal
languages and computational linguistics); C4240C
(Computational complexity)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Buffalo, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arithmetical hierarchy; complexity class index sets;
complexity class presentations; computational
complexity; enforcable properties; exponential time;
formal languages; indexing; infinite polynomial
hierarchy; P-biimmune languages; P-immune languages;
priority argument; recursively presentable class; set
theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- argument,
146(1)69,
146(1)269,
151(2)353,
156(1)99,
160(1)321,
166(1)147,
171(1)221,
192(2)201
- arithmetical,
137(1)3,
163(1)245,
173(1)151,
193(1)129,
222(1)55
- 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)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)137,
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
- exponential,
154(1)23,
154(1)57,
155(1)141,
168(1)3,
172(1)121,
183(2)215,
186(1)107
- 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,
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,
194(1)137,
195(2)133,
198(1)99,
205(1)45,
205(1)317,
207(1)89,
207(1)131,
210(1)21,
215(1)289
- index,
145(1)371,
150(2)195,
150(2)197,
150(2)339,
160(1)383,
161(1)191,
168(1)21,
170(1)467,
176(1)283,
180(1)379,
181(1)91,
185(2)411,
213(1)5,
213(1)529,
219(1)111,
228(1)283,
229(1)199
- indexing,
210(2)245
- infinite,
138(1)3,
138(2)273,
138(2)353,
139(1)315,
143(2)335,
151(1)37,
152(2)219,
152(2)285,
154(1)67,
154(2)387,
158(1)65,
159(2)143,
161(1)205,
163(1)99,
164(1)13,
164(1)165,
165(1)57,
172(1)67,
174(1)1,
175(1)93,
175(1)127,
176(1)111,
177(2)487,
180(1)81,
183(1)21,
187(1)203,
189(1)1,
192(1)77,
194(1)246-2,
195(2)113,
200(1)135,
207(2)363,
212(1)29,
218(1)177,
221(1)251
- presentation,
146(1)321,
158(1)81,
183(1)83,
197(1)244-2
- priority,
148(1)171,
155(1)141,
164(1)1,
177(2)351,
178(1)119,
182(1)145,
189(1)179,
195(2)227,
200(1)289,
202(1)1,
205(1)99,
208(1)87,
254(1)691
- recursively,
147(1)149,
160(1)241,
161(1)235,
168(2)321,
197(1)79,
205(1)61,
205(1)195
- Regan, Kenneth W.,
148(2)325,
188(1)101,
191(1)97