Entry Savicky:1997:LBB 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{Savicky:1997:LBB,
author = "Petr Savick{\'y} and Stanislav {\v{Z}}{\'a}k",
title = "A lower bound on branching programs reading some bits
twice",
journal = j-THEOR-COMP-SCI,
volume = "172",
number = "1--2",
pages = "293--301",
day = "10",
month = feb,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:35 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=172&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=1997&volume=172&issue=1-2&aid=2394",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Comput. Sci., Czechoslovak Acad. of Sci.,
Prague, Czech Republic",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean function; Boolean functions; branching
programs; computational complexity; computations;
polynomial time; programming theory; repeatedly tested
input bits; superpolynomial",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bit,
141(1)175,
141(1)283,
164(1)1,
172(1)303,
177(2)425,
178(1)155
- 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,
155(2)411,
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,
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,
155(2)411,
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,
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
- branching,
138(2)391,
140(1)53,
145(1)45,
146(1)25,
148(1)93,
160(1)241,
170(1)297,
177(2)487,
179(1)217,
179(1)397,
181(1)141,
202(1)223
- input,
138(1)101,
138(2)391,
141(1)269,
143(1)123,
148(1)33,
154(1)57,
156(1)39,
156(1)281,
160(1)305,
163(1)211,
172(1)1,
178(1)103,
182(1)145
- lower,
140(2)301,
143(2)335,
145(1)45,
154(2)283,
155(2)411,
156(1)315,
157(2)139,
157(2)185,
157(2)259,
162(2)341,
163(1)177,
172(1)1,
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
- superpolynomial,
148(1)111