On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (Q2332856)
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: On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates |
scientific article; zbMATH DE number 7126305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates |
scientific article; zbMATH DE number 7126305 |
Statements
On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (English)
0 references
5 November 2019
0 references
bounded-depth circuits
0 references
complexity
0 references
Boolean cube partitions
0 references
0.8902426362037659
0 references
0.8655586242675781
0 references
0.8566211462020874
0 references
0.8346171379089355
0 references
0.8344307541847229
0 references
