#### Filter Results:

- Full text PDF available (26)

#### Publication Year

2006

2018

- This year (6)
- Last 5 years (31)
- Last 10 years (48)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
- 2009 24th Annual IEEE Conference on Computationalâ€¦
- 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â€¦ (More)

- Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
- CATS
- 2009

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â€¦ (More)

- Nutan Limaye, Meena Mahajan, Jayalal Sarma
- Electronic Colloquium on Computational Complexity
- 2006

We revisit monotone planar circuits MPCVP, with special attention to circuits with cylindrical embeddings. MPCVP is known to be in NC in general, and in LogDCFL for the special case of upwardâ€¦ (More)

- Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
- FSTTCS
- 2008

We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL âˆ© coUL [TW08]. In this paper, we give a deterministic log-spaceâ€¦ (More)

- Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan
- Electronic Colloquium on Computational Complexity
- 2014

- Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
- Electronic Colloquium on Computational Complexity
- 2015

Nisan (STOC 1991) exhibited a polynomial which is computable by linear sized noncommutative circuits but requires exponential sized non-commutative algebraic branching programs. Nisanâ€™s hardâ€¦ (More)

- Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
- CSR
- 2007

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â€¦ (More)

- Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao
- Electronic Colloquium on Computational Complexity
- 2007

- Nutan Limaye, Meena Mahajan, Jayalal Sarma
- computational complexity
- 2009

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 inâ€¦ (More)

- HervÃ© Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
- SIAM J. Comput.
- 2015