The Power of Negative Thinking in Multiplying Boolean Matrices
From MaRDI portal
Recommendations
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- On the multiplicative complexity of Boolean functions
- Multiplicative complexity of some Boolean functions
- Representing \((0,1)\)-matrices by Boolean circuits
- Circuit complexity and multiplicative complexity of Boolean functions
Cited in
(18)- scientific article; zbMATH DE number 7250166 (Why is no real title available?)
- On the optimality of Bellman-Ford-Moore shortest path algorithm
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
- scientific article; zbMATH DE number 7701440 (Why is no real title available?)
- Lower bounds for monotone q-multilinear Boolean circuits
- Lower bounds on monotone complexity of the logical permanent
- On Negations in Boolean Networks
- Bounds for semi-disjoint bilinear forms in a unit-cost computational model
- Negation can be exponentially powerful
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
- The monotone circuit complexity of Boolean functions
- Polynomial threshold functions of bounded tree-width: some explainability and complexity aspects
- On the complexity of 2-output Boolean networks
- A fast output-sensitive algorithm for Boolean matrix multiplication
- A lower bound for the computational complexity of a set of disjunctives in a monotone basis
- Switching functions whose monotone complexity is nearly quadratic
- Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
- scientific article; zbMATH DE number 3795354 (Why is no real title available?)
This page was built for publication: The Power of Negative Thinking in Multiplying Boolean Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4081156)
