B. V. Raghavendra Rao

Algorithmica, October, 2023

2022

Isomorphism testing of read-once functions and polynomials.

[BibT_eX]

[DOI]

Inf. Comput., 2022

2021

Limitations of Sums of Bounded Read Formulas and ABPs.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2021

2020

Lower bounds for special cases of syntactic multilinear ABPs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

On hard instances of non-commutative permanent.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Limitations of Sums of Bounded-Read Formulas.

[BibT_eX]

[DOI]

CoRR, 2020

On Measures of Space over Real and Complex Numbers.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Lower bounds for Sum and Sum of Products of Read-once Formulas.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

Linear projections of the Vandermonde polynomial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A note on parameterized polynomial identity testing using hitting set generators.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Parameterised Counting Classes with Bounded Nondeterminism.

[BibT_eX]

[DOI]

Anselm Haak

Arne Meier

CoRR, 2019

Lower bounds for multilinear bounded order ABPs.

[BibT_eX]

[DOI]

CoRR, 2019

Lower Bounds for Multilinear Order-Restricted ABPs.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2017

On Weak-Space Complexity over Complex Numbers.

[BibT_eX]

[DOI]

Pushkar S. Joglekar

Siddharth S. Sivakumar

Electron. Colloquium Comput. Complex., 2017

On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Testing Polynomial Equivalence by Scaling Matrices.

[BibT_eX]

[DOI]

Markus Bläser

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation.

[BibT_eX]

[DOI]

Algorithmica, 2016

Sum of Products of Read-Once Formulas.

[BibT_eX]

[DOI]

Ramya C.

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Limitations of sum of products of Read-Once Polynomials.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.

[BibT_eX]

[DOI]

Karl Bringmann

Bodo Manthey

Algorithmica, 2015

Parameterized Analogues of Probabilistic Computation.

[BibT_eX]

[DOI]

Ankit Chauhan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Monomials, multilinearity and identity testing in simple read-restricted circuits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

New Algorithms and Hard Instances for Non-Commutative Computation.

[BibT_eX]

[DOI]

CoRR, 2014

Complexity of Testing Reachability in Matroids.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2014

2013

Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas.

[BibT_eX]

[DOI]

Comput. Complex., 2013

Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits.

[BibT_eX]

[DOI]

Maurice J. Jansen

Comput. Complex., 2013

Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals.

[BibT_eX]

[DOI]

Markus Bläser

Bodo Manthey

Algorithmica, 2013

2012

Counting classes and the fine structure between NC1 and L.

[BibT_eX]

[DOI]

Samir Datta

Michael Thomas

Heribert Vollmer

Theor. Comput. Sci., 2012

Faster algorithms for finding and counting subgraphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

A Probabilistic Analysis of Christofides' Algorithm.

[BibT_eX]

[DOI]

Markus Bläser

Konstantinos Panagiotou

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Random Shortest Path Metrics with Applications.

[BibT_eX]

Bodo Manthey

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

On the Complexity of Matroid Isomorphism Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

2010

Arithmetizing Classes Around NC\textsf{NC}1 and L\textsf{L}.

[BibT_eX]

[DOI]

Nutan Limaye

Theory Comput. Syst., 2010

2009

Small-Space Analogues of Valiant's Classes.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Small space analogues of Valiant's classes and the limitations of skew formula.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009

On the Complexity of Matroid Isomorphism Problems.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2009

Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.

[BibT_eX]

[DOI]

Maurice J. Jansen

Proceedings of the Computer Science, 2009

2008

Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2008

2007

Arithmetizing classes around NC^1 and L.

[BibT_eX]

[DOI]

Nutan Limaye

Electron. Colloquium Comput. Complex., 2007

Arithmetizing Classes Around NC 1 and L.

[BibT_eX]

[DOI]

Nutan Limaye