Items where Author is "Arvind, V."

Article

Allender, Eric ; Arvind, V. ; Mahajan, Meena (2013) Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series Theory of Computing Systems, 53 (3). pp. 503-506. ISSN 1432-4350

Allender, Eric ; Arvind, V. ; Mahajan, Meena (2003) Arithmetic Complexity, Kleene Closure, and Formal Power Series Theory of Computing Systems, 36 (4). pp. 303-328. ISSN 1432-4350

Agrawal, M. ; Arvind, V. (1996) A note on decision versus search for graph automorphism Information and Computation, 131 (2). pp. 179-189. ISSN 0890-5401

Agrawal, M. ; Arvind, V. (1996) A note on decision versus search for graph automorphism Proceedings of Eleventh Annual IEEE Conference on Computational Complexity . pp. 272-277. ISSN 1093-0159

Agrawal, M. ; Arvind, V. (1996) Geometric sets of low information content Theoretical Computer Science, 158 (1-2). pp. 193-219. ISSN 0304-3975

Agrawal, M. ; Arvind, V. (1996) Quasi-linear truth-table reductions to p-selective sets Theoretical Computer Science, 158 (1-2). pp. 361-370. ISSN 0304-3975

Agrawal, M. ; Arvind, V. (1995) Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets Proceedings of Tenth Annual IEEE Structure in Complexity Theory Conference, 1995 . pp. 264-276. ISSN 1063-6870

Agrawal, M. ; Arvind, V. (1994) Polynomial time truth-table reductions to p-selective sets Proceedings of the Ninth Annual Structure in Complexity Theory Conference, 1994 . pp. 24-30.