8 citations · 28 across the 39 of their papers we have counts for
Showing 2017 · cs.CCShow all
2 papers · 2 filters
cs.CC2017★ 1 cited
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
V. Arvind, Johannes Köbler, Sebastian Kuhnert +1
Lubiw showed that several variants of Graph Isomorphism are NP-complete, where the solutions are required to satisfy certain additional constraints [SICOMP 10, 1981]. One of these,…
cs.CC2017
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings
V. Arvind, Rajit Datta, Partha Mukhopadhyay +1
In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring . Prior to this work, nonassociative…