scientific article; zbMATH DE number 7204282

DOI10.4230/LIPIcs.CCC.2017.31zbMath1440.68104arXiv1507.00177MaRDI QIDQ5111162

Mrinal Kumar, Ramprasad Saptharishi

Publication date: 26 May 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsseparationsarithmetic circuitsdepth reduction

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (9)

Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits ⋮ The Computational Power of Depth Five Arithmetic Circuits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Symmetries of and Equivalence Test for Design Polynomials.

This page was built for publication: