( en | de | ru )

 

Disambiguation of "Arvind, Vikraman"

Author of the publication

copydeleteadd this publication to your clipboard
The ideal membership problem and polynomial identity testing.

, and . Inf. Comput., 208 (4): 351-363 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arvind Batra

Arvind Agarwal

Arvind Dev

Arvind Krishnamurthy

Arvind Krishnaswamy

 

Other publications of authors with the same name

A Note on Polynomial Identity Testing for Depth-3 Circuits., , , and . CoRR, (2018)On the Complexity of Computing Units in a Number Field., and . ANTS, volume 3076 of Lecture Notes in Computer Science, page 72-86. Springer, (2004)Randomized polynomial time identity testing for noncommutative circuits., , , and . STOC, page 831-841. ACM, (2017)On the hardness of the noncommutative determinant., and . Comput. Complex., 27 (1): 1-29 (2018)New Results on Noncommutative and Commutative Polynomial Identity Testing., , and . Comput. Complex., 19 (4): 521-558 (2010)The orbit problem is in the GapL hierarchy., and . J. Comb. Optim., 21 (1): 124-137 (2011)Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 29-42. Springer, (2022)Equivalence Testing of Weighted Automata over Partially Commutative Monoids., , , and . MFCS, volume 202 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Exact learning via teaching assistants., and . Theor. Comput. Sci., 241 (1-2): 51-81 (2000)Parameterized Complexity of Small Weight Automorphisms and Isomorphisms., , , and . Algorithmica, 83 (12): 3567-3601 (2021)