pith. sign in

V. Arvind

Identifiers

  • name variant V. Arvind 0.60 · backfill

Papers (24)

  1. On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties cs.DM · 2018 · author #1
  2. Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators cs.DS · 2018 · author #1
  3. A Note on Polynomial Identity Testing for Depth-3 Circuits cs.CC · 2018 · author #1
  4. Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable cs.CC · 2017 · author #1
  5. Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings cs.CC · 2017 · author #1
  6. The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs cs.CC · 2016 · author #1
  7. Randomized Polynomial Time Identity Testing for Noncommutative Circuits cs.CC · 2016 · author #1
  8. Some Lower Bound Results for Set-Multilinear Arithmetic Computations cs.CC · 2015 · author #1
  9. Noncommutative Valiant's Classes: Structure and Complete Problems cs.CC · 2015 · author #1
  10. Graph Isomorphism, Color Refinement, and Compactness cs.CC · 2015 · author #1
  11. On the Complexity of Noncommutative Polynomial Factorization cs.CC · 2015 · author #1
  12. Near-Optimal Expanding Generating Sets for Solvable Permutation Groups cs.CC · 2012 · author #1
  13. On the hardness of the noncommutative determinant cs.CC · 2009 · author #1
  14. Arithmetic Circuits and the Hadamard Product of Polynomials cs.CC · 2009 · author #1
  15. On Lower Bounds for Constant Width Arithmetic Circuits cs.CC · 2009 · author #1
  16. Quantum Query Complexity of Multilinear Identity Testing cs.CC · 2008 · author #1
  17. Lattice Problems, Gauge Functions and Parameterized Algorithms cs.CC · 2008 · author #1
  18. Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size cs.CC · 2008 · author #1
  19. New results on Noncommutative and Commutative Polynomial Identity Testing cs.CC · 2008 · author #1
  20. On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach math.CO · 2007 · author #1
  21. A Polynomial Time Nilpotence Test for Galois Groups and Related Results cs.CC · 2006 · author #1
  22. The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems quant-ph · 2002 · author #1
  23. Nonstabilizer Quantum Codes from Abelian Subgroups of the Error Group quant-ph · 2002 · author #1
  24. A Family of Quantum Stabilizer Codes Based on the Weyl Commutation Relations over a Finite Field quant-ph · 2002 · author #1

Mentions

  • 1511.02308 #1 · backfill · confidence 0.70 V. Arvind
  • 1508.00395 #1 · backfill · confidence 0.70 V. Arvind
  • 1502.01255 #1 · backfill · confidence 0.70 V. Arvind
  • 1501.00671 #1 · backfill · confidence 0.70 V. Arvind
  • 1201.3181 #1 · backfill · confidence 0.70 V. Arvind
  • 0910.2370 #1 · backfill · confidence 0.70 V. Arvind
  • 0907.4006 #1 · backfill · confidence 0.70 V. Arvind
  • 0907.3780 #1 · backfill · confidence 0.70 V. Arvind
  • 0807.1412 #1 · backfill · confidence 0.70 V. Arvind
  • 0804.4744 #1 · backfill · confidence 0.70 V. Arvind
  • 0804.0957 #1 · backfill · confidence 0.70 V. Arvind
  • 0801.0514 #1 · backfill · confidence 0.70 V. Arvind

Frequent Coauthors