Shifting Graphs and Their Applications
From MaRDI portal
Cited in
(17)- scientific article; zbMATH DE number 7250166 (Why is no real title available?)
- Reductions for monotone Boolean circuits
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
- A lower bound on strictly non-blocking networks
- Rotator design
- The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs
- On Negations in Boolean Networks
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- Negation can be exponentially powerful
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
- A New Lower Bound for the Number of Switches in Rearrangeable Networks
- Rearrangeable Networks with Limited Depth
- Size-space tradeoffs for oblivious computations
- Efficient monotone circuits for threshold functions
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
- On shifting networks
- Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
This page was built for publication: Shifting Graphs and Their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4102736)