Pages that link to "Item:Q4102736"
From MaRDI portal
The following pages link to Shifting Graphs and Their Applications (Q4102736):
Displaying 16 items.
- Rotator design (Q585173) (← links)
- On shifting networks (Q685361) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- Size-space tradeoffs for oblivious computations (Q1052095) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- A lower bound on strictly non-blocking networks (Q1111529) (← links)
- Efficient monotone circuits for threshold functions (Q1122560) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426) (← links)
- Negation can be exponentially powerful (Q1143790) (← 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)
- On Negations in Boolean Networks (Q3644711) (← links)
- Rearrangeable Networks with Limited Depth (Q3956854) (← links)
- A New Lower Bound for the Number of Switches in Rearrangeable Networks (Q3960605) (← links)
- (Q5121914) (← links)
