No. Title Author Year
1 Efficient Black-Box Identity Testing for Free Group Algebras Arvind, V. et al. 2019
2 Fast Exact Algorithms Using Hadamard Product of Polynomials Arvind, V. et al. 2019
3 On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials Arvind, V. et al. 2019
4 Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable Arvind, Vikraman et al. 2018
5 Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators Arvind, V. et al. 2018
6 Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings Arvind, Vikraman et al. 2017
7 Parameterized Complexity of Small Weight Automorphisms Arvind, Vikraman et al. 2017
8 The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs Arvind, Vikraman et al. 2016
9 Colored Hypergraph Isomorphism is Fixed Parameter Tractable Arvind, V. et al. 2010
10 The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets Arvind, Vikraman et al. 2010
11 Arithmetic Circuits and the Hadamard Product of Polynomials Arvind, Vikraman et al. 2009
12 Quantum Query Complexity of Multilinear Identity Testing Arvind, Vikraman et al. 2009
13 Some Sieving Algorithms for Lattice Problems Arvind, V. et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 13


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