scientific article; zbMATH DE number 7250152
From MaRDI portal
Publication:5121900
DOI10.4230/LIPIcs.CCC.2018.12zbMath1441.68039MaRDI QIDQ5121900
Ivan Mihajlin, Marco L. Carmosino, Russell Impagliazzo, Shachar Lovett
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 (4)
Unnamed Item ⋮ Lower bounds for arithmetic circuits via the Hankel matrix ⋮ A super-quadratic lower bound for depth four arithmetic circuits ⋮ Hardness magnification near state-of-the-art lower bounds
Cites Work
- Arithmetic circuits: the chasm at depth four gets wider
- The complexity of partial derivatives
- Arithmetic Circuits: A Chasm at Depth 3
- Arithmetic Circuits: A survey of recent results and open questions
- Powers of tensors and fast matrix multiplication
- Noncommutative Valiant's Classes
- Succinct hitting sets and barriers to proving algebraic circuits lower bounds
- Randomized polynomial time identity testing for noncommutative circuits
- On the hardness of the noncommutative determinant
- Non-commutative circuits and the sum-of-squares problem
- Natural proofs
This page was built for publication:
