Better bounds for threshold formulas
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 314-323
- https://doi.org/10.1109/sfcs.1991.185384
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Perfect hashing, graph entropy, and circuit complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Optimal separations between concurrent-write parallel machinesPublished by Association for Computing Machinery (ACM) ,1989
- Amplification of probabilistic boolean formulasPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- On the Size of Separating Systems and Families of Perfect Hash FunctionsSIAM Journal on Algebraic Discrete Methods, 1984
- Bounds for Hodes - Specker theoremPublished by Springer Nature ,1984
- Sorting inc logn parallel stepsCombinatorica, 1983
- $\Omega (n\log n)$ Lower Bounds on Length of Boolean FormulasSIAM Journal on Computing, 1982
- An information-theoretic method in combinatorial theoryJournal of Combinatorial Theory, Series A, 1977
- Reliable circuits using less reliable relaysJournal of the Franklin Institute, 1956