The complexity of symmetric functions in bounded-depth circuits
- 17 June 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (4) , 217-219
- https://doi.org/10.1016/0020-0190(87)90163-3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Properties of complexity measures for PRAMs and WRAMsTheoretical Computer Science, 1986
- Bounded-depth, polynomial-size circuits for symmetric functionsTheoretical Computer Science, 1985
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984