Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy (Q4863976)
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 838846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy |
scientific article; zbMATH DE number 838846 |
Statements
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy (English)
0 references
2 July 1996
0 references
circuit complexity
0 references
graph entropy
0 references
low-complexity functions
0 references
0.7845330834388733
0 references
0.779674768447876
0 references
0.7769932746887207
0 references
