#### Filter Results:

- Full text PDF available (85)

#### Publication Year

1982

2017

- This year (3)
- Last 5 years (32)
- Last 10 years (69)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### 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 ModkP 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 FPSPP algorithm. This general result has other consequences: for example, it follows that the hidden subgroup problem… (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)

- Manindra Agrawal, Vikraman Arvind
- Structure in Complexity Theory Conference
- 1994

For any class IC E {NP,PP,C=P,@P} we show that i j K is quasi-linear truth-table reducible t o a pselective set then IC = P. For other ModkP classes (IC > 2/ we show that if ModkP is o(1og n)-truth-table reduci le to a p-selective set then ModkP = P.

- Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
- Algorithmica
- 2009

We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism, denoted CHI, which has running time (2 b N) O(1), where the parameter b is the maximum size of the color classes of the given hypergraphs and N is the input size. We also describe an fpt algorithm for a parameterized coset intersection problem that is used as a… (More)

- Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
- FSTTCS
- 2009

Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity testing. Our main results are the following. • We show that noncommutative polynomial identity testing for algebraic… (More)

- Vikraman 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, Jacobo Torán
- Bulletin of the EATCS
- 2005

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

- Vikraman Arvind, Johannes Köbler, Martin Mundhenk
- FSTTCS
- 1992

In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic randomized and nondeterministic reductions We show that if an NP complete set is bounded truth table reducible to some set that conjunctively reduces to a sparse set then P NP This result subsumes and extends… (More)