Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Michael A. Forbes' in GoogleThis author has not been identified. Look up 'Mrinal Kumar' in GoogleThis author has not been identified. Look up 'Ramprasad Saptharishi' in Google

runs on WebDSL