( en | de | ru )

 

Disambiguation of "Sarma, Jayalal"

Author of the publication

copydeleteadd this publication to your clipboard
Characterization and Lower Bounds for Branching Program Size using Projective Dimension.

, , and . Electron. Colloquium Comput. Complex., (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sarma Siahaan

Nima Sarmadi

Srikrishna Sarma

Pranab Kumar Sarma

Santanu Sarma

 

Other publications of authors with the same name

Pebbling Meets Coloring: Reversible Pebble Game On Trees., , and . CoRR, (2016)On the Complexity of L-reachability., , and . CoRR, (2017)Min/Max-Poly Weighting Schemes and the NL versus UL Problem., , and . TOCT, 9 (2): 10:1-10:25 (2017)Upper Bounds for Monotone Planar Circuit Value and Variants., , and . Comput. Complex., 18 (3): 377-412 (2009)On the Complexity of Matrix Rank and Rigidity., and . CSR, volume 4649 of Lecture Notes in Computer Science, page 269-280. Springer, (2007)On Pure Space vs Catalytic Space., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 439-451. Springer, (2020)On the Complexity of L-reachability., , and . DCFS, volume 8614 of Lecture Notes in Computer Science, page 258-269. Springer, (2014)Sensitivity, Affine Transforms and Quantum Communication Complexity., and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 140-152. Springer, (2019)Space complexity of reachability testing in labelled graphs., , and . J. Comput. Syst. Sci., (2019)On Isomorphism Testing of Groups with Normal Hall Subgroups., , and . STACS, volume 9 of LIPIcs, page 567-578. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)