Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits
- 1 December 1990
- journal article
- research article
- Published by Springer Nature in Mathematical Notes
- Vol. 48 (6) , 1226-1234
- https://doi.org/10.1007/bf01240265
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Lower bounds to the complexity of symmetric Boolean functionsTheoretical Computer Science, 1990
- Ramsey TheoryScientific American, 1990
- On the method of approximationsPublished by Association for Computing Machinery (ACM) ,1989
- Meanders, Ramsey theory and lower bounds for branching programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Bounds for Width Two Branching ProgramsSIAM Journal on Computing, 1986
- Two lower bounds for branching programsPublished by Association for Computing Machinery (ACM) ,1986
- A lower bound on complexity of branching programsPublished by Springer Nature ,1984
- Lower bounds by probabilistic argumentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983