On realization complexity of linear Boolean transformations by schemes of depth 3 (Q1406385)
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 1974829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On realization complexity of linear Boolean transformations by schemes of depth 3 |
scientific article; zbMATH DE number 1974829 |
Statements
On realization complexity of linear Boolean transformations by schemes of depth 3 (English)
0 references
4 September 2003
0 references
Denote by \(L^a(M)\) the realization complexity of the system of functions prescribed by the matrix \(M\) which is performed by schemes of depth \(a\), \( L_T(M)\) is the complexity of the trivial realization of the system of functions prescribed by the matrix \(M\). The author presents the construction of a sequence of matrices without the rectangles \(Q_n\) for which the estimate \[ \frac{L^3(Q_n)}{L_T(Q_n)} \lesssim \frac 7{12} \] is valid.
0 references
schemes of depth 3
0 references
linear Boolean transformations
0 references
0.842829704284668
0 references
0.79987633228302
0 references
