Browse by Author

Conference Proceedings

Kayal, Neeraj and Koiran, Pascal and Pecatte, Timothee and Saha, Chandan (2015) Lower Bounds for Sums of Powers of Low Degree Univariates. In: 42nd International Colloquium on Automata, Languages and Programming (ICALP), JUL 06-10, 2015, Kyoto, JAPAN, pp. 810-821.

Kayal, Neeraj and Limaye, Nutan and Saha, Chandan and Srinivasan, Srikanth (2014) An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS), OCT 18-21, 2014, Microsoft Res New England, Philadelphia, PA, pp. 61-70.

Journal Article

Kayal, Neeraj and Nair, Vineet and Saha, Chandan (2019) Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. In: COMPUTATIONAL COMPLEXITY, 28 (4). pp. 749-828.

Kayal, Neeraj and Saha, Chandan and Tavenas, Sebastien (2018) On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree. In: THEORY OF COMPUTING, 14 .

Kayal, Neeraj and Limaye, Nutan and Saha, Chandan and Srinivasan, Srikanth (2017) AN EXPONENTIAL LOWER BOUND FOR HOMOGENEOUS DEPTH FOUR ARITHMETIC FORMULAS. In: SIAM JOURNAL ON COMPUTING, 46 (1, SI). pp. 307-335.

Kayal, Neeraj and Saha, Chandan (2017) Multi-k-ic Depth Three Circuit Lower Bound. In: THEORY OF COMPUTING SYSTEMS, 61 (4, SI). pp. 1237-1251.

Agrawal, Manindra and Saha, Chandan and Saptharishi, Ramprasad and Saxena, Nitin (2016) JACOBIAN HITS CIRCUITS: HITTING SETS, LOWER BOUNDS FOR DEPTH-D OCCUR-k FORMULAS AND DEPTH-3 TRANSCENDENCE DEGREE-k CIRCUITS. In: SIAM JOURNAL ON COMPUTING, 45 (4, SI). pp. 1533-1562.

Kayal, Neeraj and Saha, Chandan (2016) LOWER BOUNDS FOR DEPTH-THREE ARITHMETIC CIRCUITS WITH SMALL BOTTOM FANIN. In: COMPUTATIONAL COMPLEXITY, 25 (2). pp. 419-454.

Aggarwal, Saurabh and Kuri, Joy and Saha, Chandan (2014) Give-and-take based peer-to-peer content distribution networks. In: SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 39 (4). pp. 843-858.