No. Title Author Year
1 CNF Satisfiability in a Subspace and Related Problems Arvind, Vikraman et al. 2021
2 Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable Arvind, Vikraman et al. 2018
3 Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings Arvind, Vikraman et al. 2017
4 Parameterized Complexity of Small Weight Automorphisms Arvind, Vikraman et al. 2017
5 The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs Arvind, Vikraman et al. 2016
6 The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets Arvind, Vikraman et al. 2010
7 Arithmetic Circuits and the Hadamard Product of Polynomials Arvind, Vikraman et al. 2009
8 Quantum Query Complexity of Multilinear Identity Testing Arvind, Vikraman et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI