The following pages link to (Q3335688):
Displaying 15 items.
- A Boolean function requiring 3n network size (Q794625) (← links)
- A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\) (Q798294) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- Through the mincing machine with a Boolean layer cake: nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving (Q1104301) (← links)
- On monotone simulations on nonmonotone networks (Q1121853) (← links)
- Bounds for the average-case complexity of monotone Boolean functions (Q1675542) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- Proof complexity of monotone branching programs (Q2104254) (← links)
- The monotone circuit complexity of quadratic Boolean functions (Q2509028) (← links)
- A Gödel Theorem on Network Complexity Lower Bounds (Q3708019) (← links)
- On nonlinear complexity of monotone realization of a family of Boolean sums (Q3758730) (← links)
- (Q3822100) (← links)
- The complexity of Boolean networks (Q3994882) (← links)
- Algorithms and Computation (Q5712145) (← links)
