Entry Andreev:1997:OBA 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{Andreev:1997:OBA,
author = "Alexander E. Andreev and Andrea E. F. Clementi and
Jos{\'e} D. P. Rolim",
title = "Optimal bounds for the approximation of {Boolean}
functions and some applications",
journal = j-THEOR-COMP-SCI,
volume = "180",
number = "1--2",
pages = "243--268",
day = "10",
month = jun,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=180&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=180&issue=1-2&aid=2420",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4210 (Formal logic); C4240C (Computational
complexity)",
corpsource = "Dept. of Math. and Mech., Moscow Univ., Russia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation; boolean function approximation; Boolean
functions; computational complexity; function
approximation; hardness function; optimal bound;
partial boolean function; Shannon function; worst-case
circuit-size complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Andreev, Alexander E.,
161(1)307,
221(1)3
- application,
137(2)177,
140(2)231,
140(2)301,
141(1)337,
148(1)67,
154(1)41,
156(1)1,
157(2)139,
159(1)15,
160(1)145,
160(1)185,
161(1)1,
161(1)301,
164(1)223,
165(2)391,
167(1)131,
172(1)175,
175(2)239,
176(1)111,
177(2)407,
181(2)379,
183(2)187,
186(1)199,
187(1)221,
187(1)263,
187(1)z,
188(1)45,
191(1)205,
192(2)233,
194(1)240-2,
194(1)242-1,
196(1)31,
196(1)319,
200(1)135,
201(1)1,
210(1)121,
215(1)31,
217(1)115,
217(2)175,
219(1)487
- approximation,
134(1)51,
137(1)145,
138(1)3,
143(1)167,
143(2)353,
144(1)67,
147(1)267,
150(1)1,
154(1)41,
157(1)3,
157(1)53,
157(1)115,
157(1)129,
157(2)161,
157(2)259,
158(1)117,
159(2)143,
161(1)1,
161(1)307,
162(2)173,
162(2)351,
165(1)57,
168(1)3,
168(1)39,
172(1)255,
173(1)49,
174(1)23,
177(1)3,
178(1)265,
179(1)319,
179(1)427,
180(1)17,
181(2)379,
182(1)233,
187(1)87,
187(1)105,
187(1)179,
187(1)z,
190(2)151,
190(2)167,
191(1)1,
197(1)111,
207(1)171,
209(1)107,
210(2)261,
210(2)327,
212(1)261,
266(1)997
- 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,
172(1)293,
174(1)137,
175(2)257,
175(2)337,
179(1)251,
179(1)427,
180(1)47,
180(1)155,
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,
172(1)293,
175(2)283,
175(2)373,
179(1)251,
179(1)301,
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
- C4130,
143(1)167,
154(1)41,
157(1)3,
157(1)53,
157(1)115,
157(1)129,
157(2)259,
158(1)117,
159(2)143,
168(1)3,
168(1)39,
172(1)255,
174(1)23,
180(1)17,
187(1)87,
187(1)105,
187(1)179,
187(1)z,
191(1)1,
197(1)111
- case, worst-,
148(1)141,
172(1)281,
178(1)119,
181(2)289,
190(2)151,
223(1)1
- Clementi, Andrea E. F.,
161(1)307,
221(1)3,
225(1)113
- hardness,
196(1)131,
209(1)287,
209(1)347,
221(1)3
- interpolation,
143(1)167,
154(1)41,
157(1)3,
157(1)53,
157(1)115,
157(1)129,
157(2)259,
158(1)117,
159(2)143,
168(1)3,
168(1)39,
170(1)1,
172(1)255,
174(1)23,
180(1)17,
187(1)87,
187(1)105,
187(1)179,
187(1)z,
191(1)1,
197(1)111
- optimal,
143(1)73,
143(1)123,
145(1)27,
147(1)1,
154(2)283,
154(2)367,
156(1)177,
157(2)161,
157(2)215,
159(2)191,
162(2)323,
163(1)239,
164(1)107,
164(1)299,
165(2)441,
166(1)221,
168(2)367,
172(1)265,
174(1)193,
178(1)225,
180(1)309,
182(1)217,
185(2)347,
188(1)1,
188(1)221,
196(1)3,
196(1)395,
197(1)189,
197(1)203,
197(1)242-2,
200(1)261,
203(2)205,
205(1)243,
210(2)341,
215(1)69,
220(2)363,
221(1)119,
222(1)113,
225(1)163,
227(1)79
- partial,
138(2)273,
139(1)163,
140(1)73,
151(1)195,
152(1)91,
154(2)379,
155(1)157,
155(2)291,
160(1)87,
161(1)289,
162(1)79,
162(2)225,
164(1)287,
168(1)21,
168(1)155,
170(1)129,
170(1)145,
170(1)209,
171(1)247,
172(1)1,
173(2)513,
175(1)3,
175(1)127,
175(2)373,
179(1)217,
179(1)421,
180(1)341,
181(1)195,
184(1)61,
184(1)145,
187(1)263,
190(2)167,
190(2)317,
192(1)55,
194(1)1,
194(1)183,
194(1)245,
194(1)246,
195(2)259,
197(1)245-2,
206(1)127,
206(1)181,
209(1)1,
210(1)121,
216(1)311,
218(1)135,
219(1)379,
224(1)215
- Rolim, José D. P.,
161(1)307,
221(1)3
- worst-case,
148(1)141,
164(1)59,
172(1)281,
178(1)119,
181(2)289,
190(2)151,
221(1)3,
223(1)1