Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity

Michael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi. Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. Electronic Colloquium on Computational Complexity (ECCC), 23:45, 2016. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: