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. In Ran Raz, editor, 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan. Volume 50 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

Abstract

Abstract is missing.