( en | de | ru )

 

Disambiguation of "Rao, B. V. Raghavendra"

Author of the publication

copydeleteadd this publication to your clipboard
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation.

, , and . Algorithmica, 76 (4): 890-909 (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

Nidamboor Vasanth Rao

Boloor Ramananda Rao

Bharathi Vasudeva Rao

 

Other publications of authors with the same name

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)Faster algorithms for finding and counting subgraphs., , , , and . J. Comput. Syst. Sci., 78 (3): 698-706 (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)Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials., , and . Electron. Colloquium Comput. Complex., (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)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)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)