#### Filter Results:

#### Publication Year

1987

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Vikraman Arvind, Venkatesh Raman
- ISAAC
- 2002

- Vikraman Arvind, Piyush P. Kurur
- FOCS
- 2002

We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in Mod k P for each k ≥ 2). We derive this result as a corollary of a more general result: we show that a generic problem FIND-GROUP has an FP SPP algorithm. This general result has other consequences: for example, it follows that the hidden subgroup problem… (More)

- Manindra Agrawal, Vikraman Arvind
- Theor. Comput. Sci.
- 1996

- V. Arvind, Nikhil. R. Devanur
- 2004

An undirected graph G is said to be d-distinguishable if there is a d-coloring of its vertex set V (G) such that no nontrivial automorphism of G preserves the coloring. The distinguishing number of a graph G is the minimum d for which it is d-distinguishable. In this paper we design efficient algorithms for computing the distinguishing numbers of trees and… (More)

- Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
- 20th Annual IEEE Conference on Computational…
- 2004

In this paper we study the complexity of bounded color multiplicity graph isomorphism BCGI/sub b/: the input is a pair of vertex-colored graphs such that the number of vertices of a given color in an input graph is bounded by b. We show that BCGI/sub b/ is in the #L hierarchy (more precisely, the Mod/sub k/L hierarchy for some constant k depending on b).… (More)

- Manindra Agrawal, Vikraman Arvind
- Theor. Comput. Sci.
- 1996

- Vikraman Arvind, Srikanth Srinivasan
- computational complexity
- 2009

\begin{abstract}
In this paper we study the computational complexity of computing the <i>noncommutative</i> determinant. We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial. Then, more generally, we also examine the complexity of algorithms computing the determinant over noncommutative domains. Our… (More)

- Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
- COCOON
- 2006

We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a black-box oracle. We give a polynomial-time quantum algorithm to compute a basis representation for a given black-box ring. Using this result we obtain polynomial-time quantum… (More)

- Vikraman Arvind, Yenjo Han, Lane A. Hemaspaandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk +4 others
- Complexity Theory: Current Research
- 1992

In this paper we study the complexity of sets that reduce to sparse sets (and tally sets), and the complexity of the simplest sparse sets to which such sets reduce. We show even with respect to very exible reductions that NP cannot have sparse hard sets unless P = NP; an immediate consequence of our results is: If any NP-complete set conjunctively reduces… (More)

- Vikraman Arvind, Johannes Köbler
- Theor. Comput. Sci.
- 2001

In this paper we extend a key result of Nisan and Wigderson NW94] to the nondeterministic setting: for all > 0 we show that if there is a language in E = DTIME(2 O(n)) that is hard to approximate by nondeterministic circuits of size 2 n , then there is a pseudorandom generator that can be used to derandomize BP NP (in symbols, BP NP = NP). By applying this… (More)