Entry Iwama:1996:TLB 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{Iwama:1996:TLB,
author = "Kazuo Iwama and Chuzo Iwamoto and Manzur Morshed",
title = "Time lower bounds do not exist for {CRCW PRAMs}",
journal = j-THEOR-COMP-SCI,
volume = "155",
number = "2",
pages = "411--424",
day = "11",
month = mar,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=155&issue=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=155&issue=2&aid=1933",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci. and Commun. Eng., Kyushu Univ.,
Fukuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; computational complexity; CRCW
PRAMs; monotonically increasing function;
nondegenerated Boolean function; parallel algorithms;
polynominally many processors; rapidly growing
function; time lower bounds; variables",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- boolean,
134(1)51,
137(1)109,
137(1)159,
137(2)237,
138(2)353,
139(1)187,
141(1)283,
143(2)335,
143(2)343,
145(1)45,
145(1)371,
156(1)99,
157(2)139,
160(1)1,
160(1)321,
160(1)365,
161(1)141,
161(1)301,
163(1)1,
163(1)283,
168(1)39,
171(1)3,
172(1)135,
172(1)233,
172(1)293,
174(1)137,
175(2)257,
175(2)337,
179(1)251,
179(1)427,
180(1)47,
180(1)155,
180(1)243,
182(1)257,
186(1)171,
188(1)117,
188(1)211,
190(2)317,
191(1)79,
197(1)247,
205(1)317,
207(2)329,
217(2)255,
223(1)193,
226(1)207
- bound,
139(1)355,
140(2)265,
140(2)301,
141(1)175,
143(2)335,
145(1)45,
145(1)271,
148(1)141,
151(1)163,
154(1)107,
154(2)165,
154(2)283,
156(1)99,
156(1)315,
157(1)129,
157(2)139,
157(2)161,
157(2)185,
157(2)259,
158(1)143,
161(1)301,
162(2)341,
163(1)177,
165(2)247,
168(1)105,
172(1)1,
172(1)293,
175(2)283,
175(2)373,
179(1)251,
179(1)301,
180(1)243,
181(1)45,
181(1)119,
181(2)307,
184(1)61,
185(1)47,
188(1)59,
188(1)117,
192(1)3,
194(1)163,
196(1)153,
197(1)95,
197(1)245-2,
201(1)63,
205(1)297,
209(1)47,
209(1)141,
209(1)389,
212(1)3
- CRCW,
143(2)309,
147(1)249,
154(2)225,
164(1)1,
164(1)299,
174(1)193,
175(2)393,
188(1)221,
205(1)231
- growing,
154(2)165
- increasing,
193(1)113,
222(1)181
- lower,
140(2)301,
143(2)335,
145(1)45,
154(2)283,
156(1)315,
157(2)139,
157(2)185,
157(2)259,
162(2)341,
163(1)177,
172(1)1,
172(1)293,
175(2)283,
179(1)251,
179(1)301,
181(1)119,
185(1)47,
188(1)59,
188(1)117,
193(1)1,
194(1)163,
196(1)153,
197(1)95,
197(1)245-2,
209(1)47,
209(1)141,
209(1)389
- many,
141(1)253,
146(1)185,
149(1)101,
166(1)263,
170(1)445,
172(1)255,
183(2)157
- monotonically,
188(1)221
- not,
147(1)149,
156(1)281,
163(1)145,
164(1)141,
191(1)145,
209(1)163,
224(1)291
- PRAMs,
196(1)153
- processor,
140(2)333,
141(1)1,
146(1)69,
146(1)109,
147(1)1,
147(1)69,
147(1)249,
154(2)225,
155(1)141,
155(2)349,
162(2)225,
162(2)323,
162(2)341,
168(1)121,
169(1)39,
173(1)209,
174(1)193,
178(1)119,
178(1)265,
179(1)251,
179(1)381,
181(2)357,
181(2)379,
183(2)281,
186(1)171,
188(1)221,
190(2)211,
196(1)347
- variable,
138(1)113,
139(1)207,
140(2)231,
140(2)249,
140(2)301,
141(1)269,
142(1)89,
144(1)59,
144(1)125,
144(1)161,
146(1)5,
148(1)141,
149(1)101,
153(1)3,
155(1)85,
155(1)277,
158(1)279,
160(1)365,
162(1)151,
167(1)47,
167(1)95,
167(1)131,
168(1)39,
168(1)155,
169(1)81,
172(1)255,
173(1)183,
173(1)283,
178(1)129,
183(2)187,
185(2)237,
192(1)3,
192(2)201,
197(1)241,
197(1)245,
209(1)237,
217(1)157,
219(1)287,
223(1)193,
224(1)73