The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of depth-3 circuits computing symmetric Boolean functions |
scientific article; zbMATH DE number 5664689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of depth-3 circuits computing symmetric Boolean functions |
scientific article; zbMATH DE number 5664689 |
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
0.8675262331962585
0 references
0.8657931685447693
0 references
0.8526906371116638
0 references
0.8415029048919678
0 references
