Complexity of the realization of a linear Boolean function in the class of \(\pi\)-schemes (Q4558295)
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 6982530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the realization of a linear Boolean function in the class of \(\pi\)-schemes |
scientific article; zbMATH DE number 6982530 |
Statements
Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes (English)
0 references
21 November 2018
0 references
Boolean function
0 references
\(\pi \)-scheme
0 references
lower complexity bound
0 references
0 references
0 references
0.8664980530738831
0 references
0.8337153196334839
0 references
