Recommendations
- The generalized complexity of linear Boolean functions
- On the complexity of linear Boolean operators with thin matrices
- scientific article; zbMATH DE number 4012495
- Computational complexity of Boolean functions
- scientific article; zbMATH DE number 4108153
- scientific article; zbMATH DE number 7650250
- Linear Transformations in Boolean Complexity Theory
- Lower bounds on the formula complexity of a linear Boolean function
- On the multiplicative complexity of Boolean functions
- On complexity of a particular Boolean functions class
Cited in
(13)- Lower bounds for matrix factorization
- Comparing the computational complexity of monomials and elements of finite abelian groups
- Cancellation-free circuits in unbounded and bounded depth
- Separating OR, SUM, and XOR circuits
- On complexity of linear operators on the class of circuits of depth 2
- Rectifier circuits of bounded depth
- On the additive complexity of GCD and LCM matrices
- Lower bounds for matrix factorization
- Linear Transformations in Boolean Complexity Theory
- On the computation complexity of the systems of finite abelian group elements
- Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)
- Applications of random algebraic constructions to hardness of approximation
- Kronecker products, low-depth circuits, and matrix rigidity
This page was built for publication: Complexity of Linear Boolean Operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396765)
