( en | de | ru )

 

Disambiguation of "Rao, B. V. Raghavendra"

Author of the publication

copydeleteadd this publication to your clipboard
Faster Algorithms for Finding and Counting Subgraphs

, , , , and . CoRR, (2009)

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

Nagaraj Narayan Rao

Ercole Rao

Yadlapalli Venkateswara Rao

 

Other publications of authors with the same name

Faster algorithms for finding and counting subgraphs., , , , and . J. Comput. Syst. Sci., 78 (3): 698-706 (2012)Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials., , and . Electron. Colloquium Comput. Complex., (2016)On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models., and . Fundam. Informaticae, 177 (1): 69-93 (2020)Lower Bounds for Special Cases of Syntactic Multilinear ABPs., and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 701-712. Springer, (2018)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)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)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)New Algorithms and Hard Instances for Non-Commutative Computation., and . CoRR, (2014)Complexity of Testing Reachability in Matroids., and . Chic. J. Theor. Comput. Sci., (2014)Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits., , and . Comput. Complex., 22 (3): 517-564 (2013)