Boolean functions whose monotone complexity is of size n^ 2 / log n
From MaRDI portal
(Redirected from Publication:1166489)
Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
Cites work
- A new lower bound on the monotone network complexity of Boolean sums
- An Improved Lower Bound for Sorting Networks
- Complexity of monotone networks for Boolean matrix product
- Complexity of Monotone Networks for Computing Conjunctions
- scientific article; zbMATH DE number 3387244 (Why is no real title available?)
- Monotone switching circuits and Boolean matrix product
- Shifting Graphs and Their Applications
- Some remarks on Boolean sums
- Switching functions whose monotone complexity is nearly quadratic
- The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
- The Power of Negative Thinking in Multiplying Boolean Matrices
Cited in
(11)- On the complexity of slice functions
- Lower bounds on monotone complexity of the logical permanent
- More on the complexity of slice functions
- The complexity of central slice functions
- The monotone circuit complexity of Boolean functions
- Entropy of contact circuits and lower bounds on their complexity
- On monotone simulations on nonmonotone networks
- Relating monotone formula size and monotone depth of Boolean functions
- Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
- On Negations in Boolean Networks
- Constructive universal algebra: An introduction
This page was built for publication: Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1166489)
