8 citations · 28 across the 39 of their papers we have counts for
Showing 2016 · cs.CCShow all
3 papers · 2 filters
cs.CC2016
Identity Testing for +-Regular Noncommutative Arithmetic Circuits
Vikraman Arvind, Pushkar Joglekar, Partha Mukhopadhyay +1
An efficient randomized polynomial identity test for noncommutative polynomials given by noncommutative arithmetic circuits remains an open problem. The main bottleneck to applying…
cs.CC2016
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
V. Arvind, Frank Fuhlbrück, Johannes Köbler +2
In this paper we study the complexity of the following problems: Given a colored graph X=(V,E,c), compute a minimum cardinality set S of vertices such that no nontrivial automorphi…
cs.CC2016
Randomized Polynomial Time Identity Testing for Noncommutative Circuits
V. Arvind, Partha Mukhopadhyay, S. Raja
In this paper we show that the black-box polynomial identity testing for noncommutative polynomials of degree and sparsity $t…