Sledovat
Meena Mahajan
Meena Mahajan
The Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, India
E-mailová adresa ověřena na: imsc.res.in - Domovská stránka
Název
Citace
Citace
Rok
The planar k-means problem is NP-hard
M Mahajan, P Nimbhorkar, K Varadarajan
Theoretical Computer Science 442, 13-21, 2012
8912012
Parameterizing above guaranteed values: MaxSat and MaxCut
M Mahajan, V Raman
Journal of Algorithms 31 (2), 335-354, 1999
3071999
Determinant: Combinatorics, Algorithms, and Complexity
M Mahajan, V Vinay
Chicago Journal of Theoretical Computer Science 1997 (5), 1997
1571997
Parameterizing above or below guaranteed values
M Mahajan, V Raman, S Sikdar
Journal of Computer and System Sciences 75 (2), 137-153, 2009
1242009
Non-commutative arithmetic circuits: depth reduction and size lower bounds
E Allender, J Jiao, M Mahajan, V Vinay
Theoretical Computer Science 209 (1-2), 47-86, 1998
1131998
The complexity of planarity testing
E Allender, M Mahajan
Information and Computation 189 (1), 117-134, 2004
662004
A combinatorial algorithm for the determinant
M Mahajan, V Vinay
SODA, 730-738, 1997
571997
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs
M Mahajan, KR Varadarajan
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
552000
Determinant: Old algorithms, new insights
M Mahajan, V Vinay
SIAM journal on Discrete Mathematics 12 (4), 474-490, 1999
471999
Feasible interpolation for QBF resolution calculi
O Beyersdorff, L Chew, M Mahajan, A Shukla
International Colloquium on Automata, Languages, and Programming, 180-192, 2015
412015
Algebraic complexity classes
M Mahajan
Perspectives in Computational Complexity: The Somenath Biswas Anniversary …, 2014
392014
Arithmetic complexity, Kleene closure, and formal power series
E Allender, V Arvind, M Mahajan
Theory of Computing Systems 36, 303-328, 2003
36*2003
Planarity, determinants, permanents, and (unique) matchings
S Datta, R Kulkarni, N Limaye, M Mahajan
ACM Transactions on Computation Theory (TOCT) 1 (3), 1-20, 2010
352010
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
O Beyersdorff, L Chew, M Mahajan, A Shukla
ACM Transactions on Computational Logic (TOCL) 19 (1), 1-26, 2017
342017
Approximate block sorting
M Mahajan, R Rama, V Raman, S Vijaykumar
International Journal of Foundations of Computer Science 17 (02), 337-355, 2006
282006
The combinatorial approach yields an NC algorithm for computing Pfaffians
M Mahajan, PR Subramanya, V Vinay
Discrete Applied Mathematics 143 (1-3), 1-16, 2004
272004
On the complexity of matrix rank and rigidity
M Mahajan, J Sarma MN
International Computer Science Symposium in Russia, 269-280, 2007
262007
The complexity of planarity testing
E Allender, M Mahajan
Annual Symposium on Theoretical Aspects of Computer Science, 87-98, 2000
262000
A combinatorial algorithm for Pfaffians
M Mahajan, PR Subramanya, V Vinay
International Computing and Combinatorics Conference, 134-143, 1999
261999
Upper bounds for monotone planar circuit value and variants
N Limaye, M Mahajan, JMN Sarma
Computational Complexity 18 (3), 377-412, 2009
252009
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20