On realization complexity of linear Boolean transformations by schemes of depth 3
From MaRDI portal
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.
Recommendations
- On the comparison of complexity of two ways of realization of some linear Boolean functions
- scientific article; zbMATH DE number 4114559
- scientific article; zbMATH DE number 4097288
- Complexity of the realization of a linear Boolean function in the class of -schemes
- scientific article; zbMATH DE number 4081452
Cited in
(11)- The complexity of the realization of subdefinite matrices by gate schemes
- On the complexity of linear Boolean operators with thin matrices
- On the comparison of complexity of two ways of realization of some linear Boolean functions
- scientific article; zbMATH DE number 3968581 (Why is no real title available?)
- scientific article; zbMATH DE number 3981870 (Why is no real title available?)
- scientific article; zbMATH DE number 4081452 (Why is no real title available?)
- scientific article; zbMATH DE number 4097288 (Why is no real title available?)
- Rectifier circuits of bounded depth
- scientific article; zbMATH DE number 4114559 (Why is no real title available?)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
- Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)
This page was built for publication: On realization complexity of linear Boolean transformations by schemes of depth 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406385)
