On the monotone circuit complexity of quadratic Boolean functions
From MaRDI portal
Recommendations
Cited in
(10)- Quadratic sequential computations of Boolean mappings
- The monotone circuit complexity of quadratic Boolean functions
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
- scientific article; zbMATH DE number 4172377 (Why is no real title available?)
- scientific article; zbMATH DE number 4074972 (Why is no real title available?)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS
- Monotone formula size of homogeneous functions
- Lower bounds for monotone q-multilinear Boolean circuits
- The conjunctive complexity of quadratic Boolean functions
- Reductions for monotone Boolean circuits
This page was built for publication: On the monotone circuit complexity of quadratic Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712145)