Jayalal Sarma
Jayalal Sarma
E-mail megerősítve itt: cse.iitm.ac.in - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
On isomorphism testing of groups with normal Hall subgroups
YM Qiao, J Sarma, BS Tang
Journal of Computer Science and Technology 27 (4), 687-701, 2012
242012
Upper bounds for monotone planar circuit value and variants
N Limaye, M Mahajan, JMN Sarma
Computational Complexity 18 (3), 377, 2009
242009
On the complexity of matrix rank and rigidity
M Mahajan, J Sarma
International Computer Science Symposium in Russia, 269-280, 2007
232007
Evaluating monotone circuits on cylinders, planes and tori
N Limaye, M Mahajan, MNJ Sarma
Annual Symposium on Theoretical Aspects of Computer Science, 660-671, 2006
172006
Deterministic Black-Box Identity Testing -Ordered Algebraic Branching Programs
M Jansen, Y Qiao, J Sarma
arXiv preprint arXiv:1002.1496, 2010
162010
Deterministic identity testing of read-once algebraic branching programs
M Jansen, Y Qiao, J Sarma
arXiv preprint arXiv:0912.2565, 2009
152009
Using elimination theory to construct rigid matrices
A Kumar, SV Lokam, VM Patankar, MNJ Sarma
computational complexity 23 (4), 531-563, 2014
142014
Arithmetic circuit lower bounds via maximum-rank of partial derivative matrices
M Kumar, G Maheshwari, J Sarma
ACM Transactions on Computation Theory (TOCT) 8 (3), 1-17, 2016
10*2016
Balancing bounded treewidth circuits
M Jansen, J Sarma
Theory of Computing Systems 54 (2), 318-336, 2014
10*2014
Pebbling meets coloring: Reversible pebble game on trees
B Komarath, J Sarma, S Sawlani
Journal of Computer and System Sciences 91, 33-41, 2018
8*2018
On the complexity of matroid isomorphism problem
BVR Rao, MNJ Sarma
Theory of Computing Systems 49 (2), 246-272, 2011
8*2011
Isomorphism testing of read-once functions and polynomials
R Rao BV, J Sarma MN
IARCS Annual Conference on Foundations of Software Technology and …, 2011
72011
Depth lower bounds against circuits with sparse orientation
S Koroth, J Sarma
Fundamenta Informaticae 152 (2), 123-144, 2017
52017
Pebbling, entropy, and branching program size lower bounds
B Komarath, J Sarma
ACM Transactions on Computation Theory (TOCT) 7 (2), 1-21, 2015
52015
Circuit complexity of properties of graphs with constant planar cutwidth
KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard
International Symposium on Mathematical Foundations of Computer Science, 336-347, 2014
42014
Limiting negations in bounded treewidth and upward planar circuits
J He, H Liang, JMN Sarma
International Symposium on Mathematical Foundations of Computer Science, 417-428, 2010
42010
Alternation, sparsity and sensitivity: Bounds and exponential gaps
K Dinesh, J Sarma
Theoretical Computer Science 771, 71-82, 2019
3*2019
Rigidity of a simple extended lower triangular matrix
M Mahajan, J Sarma
Information processing letters 107 (5), 149-153, 2008
32008
Min/Max-Poly Weighting Schemes and the NL versus UL Problem
A Dhayal, J Sarma, S Sawlani
ACM Transactions on Computation Theory (TOCT) 9 (2), 1-25, 2017
2*2017
On the Complexity of Matroid Isomorphism Problem
BV Raghavendra Rao, J Sarma
22008
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20