scientific article; zbMATH DE number 7250166
From MaRDI portal
Publication:5121914
DOI10.4230/LIPIcs.CCC.2018.26zbMath1441.68042MaRDI QIDQ5121914
Publication date: 22 September 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (2)
Lower bounds for monotone \(q\)-multilinear Boolean circuits ⋮ Lower Bounds for DeMorgan Circuits of Bounded Negation Width
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
- The monotone circuit complexity of Boolean functions
- Negation can be exponentially powerful
- Complexity of monotone networks for Boolean matrix product
- Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
- Monotone switching circuits and Boolean matrix product
- A lower bound on the number of additions in monotone computations
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution
- Powers of tensors and fast matrix multiplication
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- On the complexity of matrix product
- On Negations in Boolean Networks
- An n3/2 lower bound on the monotone network complexity of the Boolean convolution
- The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
- The Power of Negative Thinking in Multiplying Boolean Matrices
- Shifting Graphs and Their Applications
- Explicit lower bound of 4.5n - o(n) for boolena circuits
- Multiplying matrices faster than coppersmith-winograd
This page was built for publication:
