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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.