Raghavendra Rao B V
Research Interests : Broadly interested in the areas
of Algorithms and Computational Complexity. Topics of
particular interest are:
- Algebraic Complexity and Arithmetic Circuits.
- Boolean Circuit Complexity.
- Complexity of Problems on Matroids
Advisor :
Meena Mahajan
Currently at: Computational Complexity group, Department of Computer Science, University of Saarland.
Reports/Papers
Arithmetizing
Classes arround NC1 and L Nutan Limaye and Meena Mahajan and Raghavendra
Rao B.V , ECCC Technical report: TR07-087, 2007. A preliminary
version appeared in Proceedings of 24th International Symposium on
Theoretical Aspects of Computer Science STACS, 22-24 Feb 2007, Aachen
(Germany). Springer-Verlag LNCS Volume 4393 pp 477--488.
Arithmetic circuits, syntactic multilinearity, and the limitations of
skew formulae
Meena Mahajan and Raghavendra Rao B V , ECCC Technical report
TR08-048, 2008, A shorter version appeared in MFCS 2008
On the Complexity of
Matroid Isomorphism Problem Raghavendra Rao B V and Jayalal
M.N. Sarma. A shorter version to appear in CSR-2009
Simulation of Arithmetical Circuits by Branching Programs
Preserving Constant Width and Syntactic Multilinearity Maurice
Jansen and Raghavendra Rao B V. To appear in CSR-2009
Small-space analogues of Valiant's classes Meena
Mahajan and Raghavendra Rao B V. To appear in FCT-2009
Contact :
Address:
Department of Computer Science
Universitaet des Saarlandes
Saarbruecken, Germany
Office: 422 Building: E 1.3
This is how I look physically.
Personal info.