Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458)
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: Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables |
scientific article; zbMATH DE number 6515865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables |
scientific article; zbMATH DE number 6515865 |
Statements
Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (English)
0 references
3 December 2015
0 references
Boolean function
0 references
polynomial
0 references
circuit
0 references
circuit complexity
0 references
lower bound
0 references
0 references
0.787734866142273
0 references
0.7874329090118408
0 references
0.7791334390640259
0 references
0.7769734859466553
0 references
0.7743008732795715
0 references
