8 citations · 15 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 1 cited
Graph Isomorphism, Color Refinement, and Compactness
V. Arvind, Johannes Köbler, Gaurav Rattan +1
Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a…
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…