On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits

DOI10.1145/3460952MaRDI QIDQ5868876zbMATH OpenOpenAlexFDO

Authors Suryajith Chillara

Publication date 24 September 2022

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3460952

zbMATH Keywords

arithmetic circuitsdepth-four circuitsiterated matrix multiplicationlower boundsmulti-\(r\)-ic circuitsmultilinear polynomials

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06)

Recommendations

• scientific article; zbMATH DE number 7650932
• On the power of homogeneous depth 4 arithmetic circuits
• Multilinear polynomial systems: root isolation and bit complexity
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions
• Reconstruction of Depth-4 Multilinear Circuits
• On low complexity bit parallel polynomial basis multipliers.
• Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
• On the complexity of multivariate blockwise polynomial multiplication

Cited in

(3)

• Multi-k-ic depth three circuit lower bound
• Multi-\(k\)-ic depth three circuit lower bound
• On the size of homogeneous and of depth four formulas with low individual degree

This page was built for publication: On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868876)