Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements |
scientific article |
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
