On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields

DOI10.1007/978-3-662-44465-8_16zbMath1426.68095arXiv1401.0189OpenAlexW1691411678MaRDI QIDQ2922606

Partha Mukhopadhyay, Suryajith Chillara

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On the Power of Homogeneous Depth 4 Arithmetic Circuits ⋮ The Computational Power of Depth Five Arithmetic Circuits

This page was built for publication: On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields