The class of 1-balanced functions and the complexity of its realization (Q1814332): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 23:31, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The class of 1-balanced functions and the complexity of its realization |
scientific article |
Statements
The class of 1-balanced functions and the complexity of its realization (English)
0 references
25 June 1992
0 references
A classification of \(n\)-variables Boolean functions is proposed according to the distribution of their unit values on the \(n\)-dimensional cube. A Boolean function is said to be \(\ell\)-balanced if the unit value vertices numbers of each two equal dimension subcubes differ no more than \(\ell\). The class of 1-balanced functions is described and asymptotic estimate of its complexity is given.
0 references
complexity estimation
0 references
switching systems
0 references
Boolean functions
0 references
asymptotic estimate
0 references
