Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio. Addition is exponentially harder than counting for shallow monotone circuits. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 1232-1245, ACM, 2017. [doi]
No references recorded for this publication.
No citations of this publication recorded.