Nutan Limaye

ScholarGPS® ID: 78639598274603

Affiliation

Indian Institute of Technology, Bombay, Mumbai, India

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Combinatorics

Metrics Summary

Publication Count

Predicted Citations

453

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
On The Closures of Monotone Algebraic Classes and Variants of the Determinant (journal article) Chaugule, Prasad \| Limaye, Nutan Algorithmica (2024). 10.1007/s00453-024-01221-8 Cite \| Source
Schur Polynomials Do Not Have Small Formulas If the Determinant does not (journal article) Chaugule, Prasad \| Kumar, Mrinal \| Limaye, Nutan \| Mohapatra, Chandra Kanta \| She, Adrian \| Srinivasan, Srikanth computational complexity, volume 32, issue 1 (2023). 10.1007/s00037-023-00236-x Cite \| Source
Planar Graph Isomorphism Is in Log-Space (journal article) Datta, Samir \| Limaye, Nutan \| Nimbhorkar, Prajakta \| Thierauf, Thomas \| Wagner, Fabian ACM Transactions on Computation Theory, volume 14, issue 2, pages 1-33 (2022). 10.1145/3543686 Cite \| Source
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication (conference) Tavenas, Sébastien \| Limaye, Nutan \| Srinivasan, Srikanth STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing (2022) Rome Italy 10.1145/3519935.3520044 Cited by (2) \| Cite \| Source
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates (journal article) Bajpai, Swapnam \| Krishan, Vaibhav \| Kush, Deepanshu \| Limaye, Nutan \| Srinivasan, Srikanth Algorithmica, volume 84, issue 4, pages 1132-1162 (2022). 10.1007/s00453-021-00915-7 Cited by (1) \| Cite \| Source
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits (conference) Limaye, Nutan \| Srinivasan, Srikanth \| Tavenas, Sebastien 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (2022) Denver, CO, USA 10.1109/FOCS52979.2021.00083 Cited by (12) \| Cite \| Source
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes (journal article) Chaugule, Prasad \| Limaye, Nutan \| Varre, Aditya ACM Transactions on Computation Theory, volume 13, issue 4, pages 1-26 (2021). 10.1145/3470858 Cited by (3) \| Cite \| Source
Variants of the Determinant Polynomial and the $$\textsf {VP}$$-Completeness (book chapter) In Computer Science – Theory and Applications Chaugule, Prasad \| Limaye, Nutan \| Pandey, Shourya Springer International Publishing (2021) 10.1007/978-3-030-79416-3_3 Cite \| Source
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (journal article) Limaye, Nutan \| Sreenivasaiah, Karteek \| Srinivasan, Srikanth \| Tripathi, Utkarsh \| Venkitesh, S. SIAM Journal on Computing, volume 50, issue 4, pages 1461-1499 (2021). 10.1137/19M1276467 Cited by (2) \| Cite \| Source
Skew circuits of small width (journal article) Balaji, Nikhil \| Krebs, Andreas \| Limaye, Nutan Theoretical Computer Science, volume 821 (2020). 10.1016/j.tcs.2017.03.013 Cite \| Source
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees (journal article) Lagarde, Guillaume \| Limaye, Nutan \| Srinivasan, Srikanth computational complexity, volume 28, issue 3, pages 471-542 (2019). 10.1007/s00037-018-0171-9 Cited by (2) \| Cite \| Source
A fixed-depth size-hierarchy theorem for AC0 [⊕] via the coin problem (conference) Limaye, Nutan \| Sreenivasaiah, Karteek \| Srinivasan, Srikanth \| Tripathi, Utkarsh \| Venkitesh, S. STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing (2019) Phoenix AZ USA 10.1145/3313276.3316339 Cited by (3) \| Cite \| Source
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes (book chapter) In Computing and Combinatorics Chaugule, Prasad \| Limaye, Nutan \| Varre, Aditya Springer International Publishing (2019) 10.1007/978-3-030-26176-4_8 Cited by (2) \| Cite \| Source
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (journal article) Chillara, Suryajith \| Limaye, Nutan \| Srinivasan, Srikanth SIAM Journal on Computing, volume 48, issue 1, pages 70-92 (2019). 10.1137/18M1191567 Cited by (4) \| Cite \| Source
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits (conference) Chillara, Suryajith \| Engels, Christian \| Limaye, Nutan \| Srinivasan, Srikanth 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018) Paris, France 10.1109/FOCS.2018.00092 Cited by (6) \| Cite \| Source
A Unified Method for Placing Problems in Polylogarithmic Depth. (conference) Krebs, Andreas \| Limaye, Nutan \| Ludwig, Michael Foundations of Software Technology and Theoretical Computer Science (2018) 10.4230/LIPIcs.FSTTCS.2017.36 Cited by (2) \| Cite \| Source
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (conference) Chillara, Suryajith \| Limaye, Nutan \| Srinivasan, Srikanth Symposium on Theoretical Aspects of Computer Science (2018) 10.4230/LIPIcs.STACS.2018.21 Cited by (3) \| Cite \| Source
On the Maximum Rate of Networked Computation in a Capacitated Network (journal article) Vyavahare, Pooja \| Limaye, Nutan \| Diwan, Ajit A. \| Manjunath, D. IEEE/ACM Transactions on Networking, volume 25, issue 4, pages 2444-2458 (2017). 10.1109/TNET.2017.2695578 Cite \| Source \| Open Access
Small Depth Proof Systems (journal article) Krebs, Andreas \| Limaye, Nutan \| Mahajan, Meena \| Sreenivasaiah, Karteek ACM Transactions on Computation Theory, volume 9, issue 1, pages 1-26 (2017). 10.1145/2956229 Cite \| Source
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (journal article) Kayal, Neeraj \| Limaye, Nutan \| Saha, Chandan \| Srinivasan, Srikanth SIAM Journal on Computing, volume 46, issue 1, pages 307-335 (2017). 10.1137/151002423 Cited by (9) \| Cite \| Source