On Negations in Boolean Networks
From MaRDI portal
Recommendations
Cites work
- A 2.5n-Lower Bound on the Combinational Complexity of Boolean Functions
- A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions
- A 4n-lower bound on the monotone network complexity of a one-output Boolean function
- A Boolean function requiring 3n network size
- A new lower bound on the monotone network complexity of Boolean sums
- A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
- An n3/2 lower bound on the monotone network complexity of the Boolean convolution
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
- Combinatorics of monotone computations
- Complexity of monotone networks for Boolean matrix product
- Graph-theoretic properties in computational complexity
- Higher lower bounds on monotone size
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 42045 (Why is no real title available?)
- scientific article; zbMATH DE number 3513337 (Why is no real title available?)
- scientific article; zbMATH DE number 1261805 (Why is no real title available?)
- scientific article; zbMATH DE number 1033441 (Why is no real title available?)
- scientific article; zbMATH DE number 953683 (Why is no real title available?)
- scientific article; zbMATH DE number 3999837 (Why is no real title available?)
- Lower bounds on monotone complexity of the logical permanent
- Monotone switching circuits and Boolean matrix product
- Natural proofs
- Negation is Powerless for Boolean Slice Functions
- On another Boolean matrix
- On Graphs that do not Contain a Thomsen Graph
- On the bottleneck counting argument
- On the combinational complexity of certain symmetric Boolean functions
- On the Complexity of Negation-Limited Boolean Networks
- On the Inversion Complexity of a System of Functions
- Shifting Graphs and Their Applications
- Some remarks on Boolean sums
- Switching functions whose monotone complexity is nearly quadratic
- Symmetric approximation arguments for monotone lower bounds without sunflowers
- The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
- The gap between monotone and non-monotone circuit complexity is exponential
- The monotone circuit complexity of Boolean functions
- The Potential of the Approximation Method
- The Power of Negative Thinking in Multiplying Boolean Matrices
- Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
Cited in
(12)- Positive and negative cycles in Boolean networks
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
- Step semantics of Boolean nets
- Lower bounds for Boolean circuits of bounded negation width
- Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
- scientific article; zbMATH DE number 3884098 (Why is no real title available?)
- SIMPLIFYING BOOLEAN NETWORKS
- scientific article; zbMATH DE number 176866 (Why is no real title available?)
- scientific article; zbMATH DE number 176876 (Why is no real title available?)
- scientific article; zbMATH DE number 7250166 (Why is no real title available?)
- scientific article; zbMATH DE number 7070937 (Why is no real title available?)
- A Boolean function requiring 3n network size
This page was built for publication: On Negations in Boolean Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644711)
