New results on Noncommutative and Commutative Polynomial
Identity Testing.
V. Arvind, Partha Mukhopadhyay, Srikanth
Srinivasan. CCC 2008, to appear.
The Monomial Ideal Membership Problem and Polynomial
Identity Testing.
V. Arvind, Partha Mukhopadhyay. 18th
International Symposium on Algorithms and Computation (ISAAC 2007),
Sendai, Japan, December 17-19, 2007, Proceedings. Lecture Notes in
Computer Science 4835 Springer 2007, 800-811.
Solvable Group Isomorphism is (almost) in NP\cap coNP
V. Arvind and Jacobo Toran. Proceedings of the 19th IEEE Conference
on Computational Complexity, pp. 91--103, June 2004.
Approximation Algorithms for Some Parameterized Counting Problems
V. Arvind and V. Raman, 13th Intl. Symposium on Algorithms, Automata, and
Computation, Lecture Notes in Computer Science 2518, pp. 453-464,
Springer 2002. The downloadable version is the older
technical report.
New Lowness Results for ZPP(NP) and other
Complexity Classes.
V. Arvind and J. Köbler, Journal of Computer and System
Sciences, 65(2): 257-277, 2002. Preliminary version in
Proceedings of the 17th Annual Symp. on Theoretical
Aspects of Computer Science, Springer-Verlag, LNCS 1770, 431--442,
2000.
The Query Complexity of Program Checking by Constant-Depth Circuits.
V. Arvind, K.V. Subrahmanyam, N.V. Vinodchandran, Chicago Journal of
Theoretical Computer Science, 2, 2002. Preliminary version in
the Proceedings of the 10th Inl. Symposium on Algorithms Automata and
Computation, LNCS, Springer, 1999.
On resource-bounded measure and pseudorandomness
V. Arvind and J. Köbler, Theoretical Computer Science
Volume 255, Issues 1-2 , 28 March 2001, Pages 205-221. Preliminary version
in Proc. 17th Conference on Foundations of Software Technology and
Theoretical Computer Science, LNCS Vol. 1346, 235-249, 1997.
On helping and interactive proof systems.
V. Arvind, J. Köbler, and R. Schuler,
International Journal of Foundations of Computer Science,
6(2), 137-153, 1995. Preliminary version was presented at the ISAAC
conference, 1994.
Monotonous and randomized reductions to sparse sets.
V. Arvind, J. Köbler, and M. Mundhenk,
In Informatique Theorique et Applications 30(2), 1996, 155-179.
Preliminary version was presented at the FSTTCS conference, 1992.