From post

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.

 

Другие публикации лиц с тем же именем

On the Complexity of L-reachability., , и . CoRR, (2017)Min/Max-Poly Weighting Schemes and the NL versus UL Problem., , и . TOCT, 9 (2): 10:1-10:25 (2017)Upper Bounds for Monotone Planar Circuit Value and Variants., , и . Comput. Complex., 18 (3): 377-412 (2009)Pebbling Meets Coloring : Reversible Pebble Game On Trees., , и . Electron. Colloquium Comput. Complex., (2016)Sensitivity, Affine Transforms and Quantum Communication Complexity., и . Electron. Colloquium Comput. Complex., (2018)On Rotation Distance of Rank Bounded Trees., и . CoRR, (2023)On the Complexity of Matrix Rank and Rigidity., и . CSR, том 4649 из Lecture Notes in Computer Science, стр. 269-280. Springer, (2007)On Pure Space vs Catalytic Space., , и . TAMC, том 12337 из Lecture Notes in Computer Science, стр. 439-451. Springer, (2020)Complexity of Testing Reachability in Matroids., и . Chic. J. Theor. Comput. Sci., (2014)Reversible Pebble Game on Trees., , и . COCOON, том 9198 из Lecture Notes in Computer Science, стр. 83-94. Springer, (2015)