Pages that link to "Item:Q4081156"
From MaRDI portal
The following pages link to The Power of Negative Thinking in Multiplying Boolean Matrices (Q4081156):
Displaying 16 items.
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- Lower bounds on monotone complexity of the logical permanent (Q1071001) (← links)
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- Switching functions whose monotone complexity is nearly quadratic (Q1133519) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- A lower bound for the computational complexity of a set of disjunctives in a monotone basis (Q1147681) (← links)
- On the complexity of 2-output Boolean networks (Q1159183) (← links)
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n (Q1166489) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← 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)
- (Q4741699) (← links)
- Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth (Q5121914) (← links)
- (Q6161063) (← links)
