scientific article; zbMATH DE number 7204270
From MaRDI portal
Publication:5111149
DOI10.4230/LIPIcs.CCC.2017.19zbMath1440.68082MaRDI QIDQ5111149
Publication date: 26 May 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 (5)
Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits ⋮ Unnamed Item ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
