The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of depth-3 circuits computing symmetric Boolean functions |
scientific article |
Statements
The complexity of depth-3 circuits computing symmetric Boolean functions (English)
0 references
29 January 2010
0 references
computational complexity
0 references
theory of computation
0 references
depth-3 circuits
0 references