( en | de | ru )

 

Disambiguation of "Rao, B. V. Raghavendra"

Author of the publication

copydeleteadd this publication to your clipboard
On Hard Instances of Non-Commutative Permanent.

, and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 171-181. Springer, (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.

J-Raghavendra Rao

V Ramgopal Rao

Bharathi Vasudeva Rao

Yadlapalli Venkateswara Rao

Balakrishna Rao

 

Other publications of authors with the same name

Lower Bounds for Special Cases of Syntactic Multilinear ABPs., and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 701-712. Springer, (2018)Sum of Products of Read-Once Formulas., and . FSTTCS, volume 65 of LIPIcs, page 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs., , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 655-667. Springer, (2012)On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction., , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 250-261. Springer, (2017)Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions., , , and . Discret. Math., 347 (12): 114162 (2024)A note on parameterized polynomial identity testing using hitting set generators., and . Inf. Process. Lett., (2019)Complexity of Testing Reachability in Matroids., and . Chic. J. Theor. Comput. Sci., (2014)Arithmetizing classes around NC^1 and L., , and . Electron. Colloquium Comput. Complex., (2007)On \varSigma \varSigma \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree., , and . FCT, volume 10472 of Lecture Notes in Computer Science, page 230-242. Springer, (2017)New Algorithms and Hard Instances for Non-Commutative Computation., and . CoRR, (2014)