Pages that link to "Item:Q1224550"
From MaRDI portal
The following pages link to Monotone switching circuits and Boolean matrix product (Q1224550):
Displaying 18 items.
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Replaceability and computational equivalence for monotone boolean functions (Q798296) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- On the complexity of slice functions (Q1066866) (← links)
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- A method for obtaining efficient lower bounds for monotone complexity (Q1112792) (← links)
- Some remarks on Boolean sums (Q1133518) (← links)
- Switching functions whose monotone complexity is nearly quadratic (Q1133519) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n (Q1166489) (← links)
- Realizing Boolean functions on disjoint sets of variables (Q1233425) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
- On algorithm complexity (Q2453388) (← links)
- Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838) (← links)
- Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (Q2988839) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth (Q5121914) (← links)
