Up a level |

Group by: Item Type | No Grouping

Number of items: **8**.

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.

Bhargava, V and Garg, A and Kayal, N and Saha, C
(2022)
*Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case.*
In: 25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems and the 26th International Conference on Randomization and Computation, APPROX/RANDOM 2022, 19 - 21 September 2022, Virtual, Urbana-Champaign.

Kayal, N and Nair, V and Saha, C
(2020)
*Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth-three circuits.*
In: ACM Transactions on Computation Theory, 12
(1).

Garg, A and Kayal, N and Saha, C
(2020)
*Learning sums of powers of low-degree polynomials in the non-degenerate case.*
In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, 16-19 Nov 2020, Durham; United States, pp. 889-899.

Garg, A and Gupta, N and Kayal, N and Saha, C
(2019)
*Determinant equivalence test over finite fields and over q.*
In: 46th International Colloquium on Automata, Languages, and Programming, 7 July 2019 - 12 July 2019, Patras.

Kayal, N and Saha, C and Tavenas, S
(2018)
*On the size of homogeneous and of depth-four formulas with low individual degree.*
In: Theory of Computing, 14
.

Kayal, N and Nair, V and Saha, C and Tavenas, S
(2018)
*Reconstruction of full rank algebraic branching programs.*
In: ACM Transactions on Computation Theory, 11
(1).

Kayal, N and Nair, V and Saha, C and Tavenas, S
(2017)
*Reconstruction of full rank algebraic branching programs.*
In: Leibniz International Proceedings in Informatics, LIPIcs, 79
(1).