On the complexity of realization of the linear function by formulas over finite Boolean bases (Q4522865)
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 1548671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of realization of the linear function by formulas over finite Boolean bases |
scientific article; zbMATH DE number 1548671 |
Statements
On the complexity of realization of the linear function by formulas over finite Boolean bases (English)
0 references
26 July 2001
0 references
Boolean functions
0 references
bases
0 references
complexity of realization
0 references
lower bound
0 references
0.9263227581977844
0 references
0.8719093203544617
0 references
0.8656135201454163
0 references
0.8656045198440552
0 references
0.8576102256774902
0 references
