scientific article
From MaRDI portal
Publication:3002820
DOI10.4086/toc.2010.v006a007zbMath1213.68318OpenAlexW2611339529MaRDI QIDQ3002820
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2010.v006a007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analytic circuit theory (94C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Some complete and intermediate polynomials in algebraic complexity theory ⋮ Uniform derandomization from pathetic lower bounds ⋮ Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science ⋮ Multi-\(k\)-ic depth three circuit lower bound ⋮ On the Power of Homogeneous Depth 4 Arithmetic Circuits ⋮ Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits ⋮ Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth ⋮ On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant ⋮ Lower bounds for matrix factorization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algebraic Complexity Classes ⋮ A super-quadratic lower bound for depth four arithmetic circuits ⋮ Unnamed Item ⋮ Lower bounds for matrix factorization ⋮ Unifying known lower bounds via geometric complexity theory ⋮ Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
This page was built for publication:
