Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6018400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements |
scientific article; zbMATH DE number 6018400 |
Statements
Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (English)
0 references
23 March 2012
0 references
circuits of finite depth
0 references
Boolean function
0 references
lower bounds
0 references
complexity
0 references
cyclic convolution
0 references
0.9144684076309204
0 references
0.8525444269180298
0 references
0.8414703011512756
0 references
0.8397307991981506
0 references
0.8258037567138672
0 references
