Limitations of Sums of Bounded Read Formulas and ABPs.
Purnata Ghosal, B. V. Raghavendra Rao
Appeared in
Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings (CSR 2021),
Lecture Notes in Computer Science, Vol 12730, pp.147-169, Jul 2021.
Parameterised Counting in Logspace.
Anselm Haak, Arne Meier, Om Prakash , B. V. Raghavendra Rao
Appeared in
38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrcken, Germany (Virtual Conference). (STACS 2021),
LIPIcs, Vol 187, pp.40:1-40:17, Mar 2021.
On Measures of Space over Real and Complex Numbers.
Om Prakash, B. V. Raghavendra Rao
Appeared in
Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings (COCOON 2020),
Lecture Notes in Computer Science, Vol 12273, pp.508-519, Aug 2020.
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models.
Lower Bounds for Multilinear Order-Restricted ABPs.
Ramya C, B. V. Raghavendra Rao
Appeared in
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. (MFCS 2019),
LIPIcs, Vol 138, pp.52:1-52:14, Aug 2019.
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models.
Purnata Ghosal, B. V. Raghavendra Rao
Appeared in
Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings (COCOON 2019),
Lecture Notes in Computer Science, Vol 11653, pp.178-192, Jul 2019.
Lower Bounds for Special Cases of Syntactic Multilinear ABPs.
Ramya C, B. V. Raghavendra Rao
Appeared in
Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings (COCOON 2018),
Lecture Notes in Computer Science, Vol 10976, pp.701-712, Jul 2018.
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree.
Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Appeared in
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings (FCT 2017),
Lecture Notes in Computer Science, Vol 10472, pp.230-242, Sep 2017.
On Weak-Space Complexity over Complex Numbers.
Pushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar
Appeared in
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings (FCT 2017),
Lecture Notes in Computer Science, Vol 10472, pp.298-311, Sep 2017.
Testing Polynomial Equivalence by Scaling Matrices.
Markus Blser, B. V. Raghavendra Rao, Jayalal Sarma
Appeared in
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings (FCT 2017),
Lecture Notes in Computer Science, Vol 10472, pp.111-122, Sep 2017.
On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction.
Purnata Ghosal, Om Prakash, B. V. Raghavendra Rao
Appeared in
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings (COCOON 2017),
Lecture Notes in Computer Science, Vol 10392, pp.250-261, Aug 2017.
Ramya C., B. V. Raghavendra Rao
Appeared in
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India (FSTTCS 2016),
LIPIcs, Vol 65, pp.39:1-39:15, Dec 2016.
On Hard Instances of Non-Commutative Permanent.
Christian Engels, B. V. Raghavendra Rao
Appeared in
Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings (COCOON 2016),
Lecture Notes in Computer Science, Vol 9797, pp.171-181, Aug 2016.
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials.
Parameterized Analogues of Probabilistic Computation.
Ankit Chauhan, B. V. Raghavendra Rao
Appeared in
Algorithms and Discrete Applied Mathematics - First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings (CALDAM 2015),
Lecture Notes in Computer Science, Vol 8959, pp.181-192, Feb 2015.
Building above read-once polynomials: identity testing and hardness of representation.
Building above Read-once Polynomials: Identity Testing and Hardness of Representation.
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Appeared in
Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings (COCOON 2014),
Lecture Notes in Computer Science, Vol 8591, pp.1-12, Aug 2014.
Monomials, multilinearity and identity testing in simple read-restricted circuits.
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems.
Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
Appeared in
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (MFCS 2013),
Lecture Notes in Computer Science, Vol 8087, pp.219-230, Aug 2013.
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits.
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs.
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Appeared in
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings (MFCS 2012),
Lecture Notes in Computer Science, Vol 7464, pp.655-667, Aug 2012.
Isomorphism testing of read-once functions and polynomials.
B. V. Raghavendra Rao, Jayalal Sarma
Appeared in
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India (FSTTCS 2011),
LIPIcs, Vol 13, pp.115-126, Dec 2011.
Type :
Member :
Area :
Lab:
