Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Planar Graph Isomorphism is in Log-Space

- Samir Datta, N. Limaye, Prajakta Nimbhorkar, T. Thierauf, F. Wagner
- Computer Science, Mathematics
- 24th Annual IEEE Conference on Computational…
- 15 July 2009

Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant gap between extant… Expand

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas

- Neeraj Kayal, N. Limaye, Chandan Saha, S. Srinivasan
- Computer Science, Mathematics
- IEEE 55th Annual Symposium on Foundations of…
- 18 October 2014

We show here a 2<sup>Ω(√d·log N)</sup> size lower bound for homogeneous depth four arithmetic formulas. That is, we give an explicit family of polynomials of degree d on N variables (with N =… Expand

Lower bounds for depth 4 formulas computing iterated matrix multiplication

- H. Fournier, N. Limaye, Guillaume Malod, S. Srinivasan
- Computer Science, Mathematics
- STOC '14
- 31 May 2014

We study the arithmetic complexity of iterated matrix multiplication. We show that any multilinear homogeneous depth 4 arithmetic formula computing the product of <i>d</i> generic matrices of size… Expand

Longest Paths in Planar DAGs in Unambiguous Log-Space

- N. Limaye, M. Mahajan, Prajakta Nimbhorkar
- Computer Science, Mathematics
- Chic. J. Theor. Comput. Sci.
- 12 February 2008

Reachability and distance computation are known to be NL-complete in general graphs, but within UL ∩ co-UL if the graphs are planar. However, finding longest paths is known to be NP-complete, even… Expand

The Coin Problem in Constant Depth: Sample Complexity and Parity Gates

- N. Limaye, K. Sreenivasaiah, S. Srinivasan, Utkarsh Tripathi, S. Venkitesh
- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 11 September 2018

The $\textit{\delta-Coin Problem}$ is the computational problem of distinguishing between coins that are heads with probability $(1+\delta)/2$ or $(1-\delta)/2,$ where $\delta$ is a parameter tending… Expand

Upper Bounds for Monotone Planar Circuit Value and Variants

- N. Limaye, M. Mahajan, J. Sarma
- Mathematics, Computer Science
- computational complexity
- 1 October 2009

Abstract.The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC3, and for the special case of upward stratified circuits, it is known to be… Expand

Planarity, Determinants, Permanents, and (Unique) Matchings

- S. Datta, Raghav Kulkarni, N. Limaye, M. Mahajan
- Mathematics, Computer Science
- TOCT
- 1 March 2010

Viewing the computation of the determinant and the permanent of integer matrices as combinatorial problems on associated graphs, we explore the restrictiveness of planarity on their complexities and… Expand

Arithmetizing Classes Around NC 1 and L

- N. Limaye, M. Mahajan, B. R. Rao
- Mathematics, Computer Science
- STACS
- 22 February 2007

The parallel complexity class NC1 has many equivalent models such as bounded width branching programs. Caussinus et.al[10] considered arithmetizations of two of these classes, #NC1 and #BWBP. We… Expand

Streaming algorithms for language recognition problems

- A. Babu, N. Limaye, J. Radhakrishnan, G. Varma
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 5 April 2011

We study the complexity of the following problems in the streaming model. Membership testing forDLIN. We show that every language in DLIN can be recognized by a randomized one-pass O(logn) space… Expand

Evaluating Monotone Circuits on Cylinders, Planes and Tori

- N. Limaye, M. Mahajan, J. Sarma
- Mathematics, Computer Science
- STACS
- 23 February 2006

We revisit monotone planar circuits MPCVP, with special attention to circuits with cylindrical embeddings. MPCVP is known to be in NC3 in general, and in LogDCFL for the special case of upward… Expand