Entry Beame:1992:CCS from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Beame:1992:CCS,
author = "P. Beame and E. Brisson and R. Ladner",
title = "The complexity of computing symmetric functions using
threshold circuits",
journal = j-THEOR-COMP-SCI,
volume = "100",
number = "1",
pages = "253--265",
day = "22",
month = jun,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory)",
corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ.,
Seattle, WA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; computing
symmetric functions; n-input parity function; n-input
symmetric function; size-depth tradeoffs; threshold
circuits; threshold logic",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- C4240P,
88(1)59,
88(2)191,
90(1)127,
90(1)151,
90(1)171,
90(1)185,
91(1)1,
91(2)129,
91(2)205,
91(2)239,
92(1)3,
92(1)19,
92(1)33,
92(1)87,
92(1)107,
92(1)145,
92(1)165,
92(1)191,
92(1)z,
92(2)301,
92(2)309,
92(2)319,
93(2)169,
93(2)245,
94(1)141,
94(2)237,
94(2)335,
95(1)169,
95(2)207,
95(2)231,
95(2)245,
95(2)323,
96(1)157,
96(1)217,
96(2)305,
96(2)345,
96(2)411,
97(1)1,
97(1)67,
97(1)105,
97(1)131,
98(2)249,
98(2)263,
99(2)279,
99(2)335,
100(1)1,
100(1)45,
100(1)105,
100(1)157,
100(1)185,
100(1)205,
100(2)365,
101(1)133,
101(2)177,
101(2)289,
101(2)337,
102(1)1,
102(1)135,
102(1)165,
102(1)185,
102(2)355,
104(2)207,
104(2)285,
106(2)361,
107(1)77,
108(2)291,
108(2)331,
112(1)5,
114(1)31,
114(1)63,
114(1)119,
114(1)173,
114(1)z,
120(2)261,
120(2)303,
125(1)3,
125(2)373,
127(1)53,
127(1)99,
127(1)123,
127(1)181,
128(1)75,
129(2)293,
130(1)49,
130(1)175,
131(1)139,
132(1)403,
134(2)493,
135(1)5,
135(2)171,
135(2)289,
135(2)377,
136(2)527
- circuit,
78(2)357,
79(1)25,
81(2)257,
82(1)85,
82(1)157,
84(2)225,
85(1)155,
86(2)343,
90(1)235,
93(2)185,
93(2)303,
95(2)207,
97(2)285,
98(2)289,
99(2)213,
101(1)133,
102(2)215,
102(2)307,
107(1)77,
107(1)95,
107(1)121,
112(2)291,
113(1)167,
116(2)415,
123(2)389,
125(2)295,
130(1)203,
132(1)347
- computing,
73(1)1,
76(2)309,
79(1)195,
79(1)209,
79(1)241,
79(2)323,
81(2)169,
81(2)201,
86(2)143,
86(2)325,
92(1)3,
92(1)87,
92(2)291,
95(2)263,
96(1)175,
98(2)249,
109(1)3,
109(1)z,
115(2)191,
119(1)215,
125(2)373,
128(1)99,
128(1)127,
128(1)159,
128(1)179,
128(1)241,
129(2)279,
133(1)35
- parity,
85(1)155,
103(1)3,
106(2)351
- size-depth,
82(1)85
- symmetric,
72(1)39,
80(2)337,
87(1)163,
88(1)59,
92(2)227,
98(1)115,
115(2)371,
117(1)113,
117(1)289,
120(2)279
- threshold,
85(1)155,
93(2)303,
95(2)187,
103(1)3,
107(1)63,
113(1)167
- tradeoff,
82(1)157,
106(1)21,
107(1)121,
110(1)99
- using,
71(3)347,
77(3)331,
79(1)209,
82(1)165,
90(2)309,
91(1)23,
99(2)213,
101(2)337,
105(1)141,
116(2)291,
117(1)99,
129(2)407,
131(1)29,
135(2)405