Towards Optimal Depth Reductions for Syntactically Multilinear Circuits

DOI10.4230/LIPIcs.ICALP.2019.78OpenAlexW2963003754MaRDI QIDQ5091237

No author found.

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1902.07063

zbMATH Keywords

lower boundsarithmetic circuitsdepth reductionmultilinear circuits

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree

Cites Work

• Unnamed Item
• Arithmetic circuits: the chasm at depth four gets wider
• Lower bounds and separations for constant depth multilinear circuits
• Non-commutative arithmetic circuits: depth reduction and size lower bounds
• Improved bounds for reduction to depth 4 and depth 3
• Arithmetic Circuits: A survey of recent results and open questions
• A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
• Approaching the Chasm at Depth Four
• Multi-linear formulas for permanent and determinant are of super-polynomial size

This page was built for publication: Towards Optimal Depth Reductions for Syntactically Multilinear Circuits