Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization

Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha 0001, Bhargav Thankey. Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. In Kousha Etessami, Uriel Feige, Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany. Volume 261 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Abstract

Abstract is missing.