( en | de | ru )

 

Disambiguation of "Sarma, Jayalal"

Author of the publication

copydeleteadd this publication to your clipboard
Using Elimination Theory to Construct Rigid Matrices.

, , , and . Comput. Complex., 23 (4): 531-563 (2014)

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

Min/Max-Poly Weighting Schemes and the NL versus UL Problem., , and . TOCT, 9 (2): 10:1-10:25 (2017)On the Complexity of L-reachability., , and . CoRR, (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 Rotation Distance of Rank Bounded Trees., and . CoRR, (2023)Pebbling Meets Coloring : Reversible Pebble Game On Trees., , and . Electron. Colloquium Comput. Complex., (2016)Sensitivity, Affine Transforms and Quantum Communication Complexity., and . Electron. Colloquium Comput. Complex., (2018)On Pure Space vs Catalytic Space., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 439-451. Springer, (2020)Isomorphism testing of read-once functions and polynomials., and . FSTTCS, volume 13 of LIPIcs, page 115-126. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space., , and . FSTTCS, volume 29 of LIPIcs, page 597-609. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)