2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2015★ 2 cited
On the Complexity of Noncommutative Polynomial Factorization
V. Arvind, Pushkar S Joglekar, Gaurav Rattan
In this paper we study the complexity of factorization of polynomials in the free noncommutative ring of polynomials over the field $\m…
cs.CC2014
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity
Vikraman Arvind, Gaurav Rattan
We give a time isomorphism testing algorithm for graphs of eigenvalue multiplicity bounded by which improves on the previous best running time bound of $O^*(2^{…