New upper bounds on the Boolean circuit complexity of symmetric functions
- 1 March 2010
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 110 (7) , 264-267
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean FunctionsSIAM Journal on Computing, 1991
- A Boolean function requiring 3n network sizeTheoretical Computer Science, 1983
- On the combinational complexity of certain symmetric Boolean functionsTheory of Computing Systems, 1976
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949