Entry Downey:1998:PCC 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{Downey:1998:PCC,
author = "Rodney G. Downey and Michael R. Fellows and Kenneth W.
Regan",
title = "Parameterized circuit complexity and the {W}
hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "191",
number = "1--2",
pages = "97--115",
day = "30",
month = jan,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=191&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2518.pdf",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory);
C4240C (Computational complexity)",
corpsource = "Dept. of Math., Victoria Univ., Wellington, New
Zealand",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating quantification; automata theory; circuit
complexity; computational complexity; constant-depth
circuits; formal logic; parameterized problem;
randomized reduction; W hierarchy",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alternating,
141(1)69,
143(1)23,
143(1)123,
148(1)33,
177(2)425,
180(1)139,
180(1)229,
198(1)99
- circuit,
137(1)109,
137(2)279,
141(1)283,
143(2)335,
148(1)33,
154(1)23,
156(1)99,
157(1)91,
158(1)193,
161(1)141,
162(1)133,
163(1)283,
174(1)137,
180(1)325,
182(1)171,
188(1)117,
191(1)215,
197(1)57,
197(1)171,
209(1)47,
209(1)389
- constant-depth,
161(1)141
- depth, constant-,
161(1)141
- Downey, Rodney G.,
147(1)31,
209(1)123
- Fellows, Michael R.,
141(1)109,
147(1)31,
209(1)123
- 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,
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
- parameterized,
141(1)109,
147(1)31,
154(2)203,
170(1)245,
183(2)187
- quantification,
137(1)3,
172(1)135,
183(2)187,
193(1)75
- randomized,
137(1)145,
148(1)133,
154(1)23,
154(2)225,
158(1)53,
162(2)245,
169(2)147,
174(1)193,
180(1)17,
181(2)229,
182(1)233,
194(1)163,
196(1)3,
207(2)329
- reduction,
135(1)67,
139(1)69,
145(1)147,
146(1)269,
148(1)19,
148(2)183,
148(2)325,
151(2)353,
151(2)437,
152(1)91,
154(1)3,
154(1)23,
155(1)85,
155(2)447,
158(1)361,
159(2)191,
161(1)69,
165(1)75,
166(1)1,
168(1)3,
170(1)83,
173(1)151,
175(1)93,
177(1)183,
181(2)229,
185(2)237,
188(1)101,
189(1)221,
190(1)3,
190(1)61,
191(1)157,
192(1)31,
192(1)55,
194(1)241-2,
194(1)244-1,
194(1)244-3,
194(1)245-2,
194(1)247-2,
194(1)248-2,
197(1)242-2,
198(1)239,
209(1)47,
212(1)211,
225(1)185
- Regan, Kenneth W.,
148(2)325,
161(1)263,
188(1)101