Up a level |
Amireddy, P and Garg, A and Kayal, N and Saha, C and Thankey, B (2023) Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 10 - 14 July 2023, Paderborn.
Gupta, N and Saha, C and Thankey, B (2023) Equivalence Test for Read-Once Arithmetic Formulas. In: 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 22-25 January 2023, Florence, Italy, pp. 4205-4272.
Saha, C and Thankey, B (2021) Hitting sets for orbits of circuit classes and polynomial families. In: 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021 and 25th International Conference on Randomization and Computation, RANDOM 2021, 16-18 Aug 2021, Bengaluru; India.
Gupta, N and Saha, C and Thankey, B (2020) A super-quadratic lower bound for depth four arithmetic circuits. In: Leibniz International Proceedings in Informatics, LIPIcs, 28 July - 31 July 2020, Virtual, Online.