T. C. Vijayaraghavan

12 papers A 3Misc 1Journal 8
YearRankTypeTitle / Venue / Authors
2023 J jnl
Some derivations among Logarithmic Space Bounded Counting Classes.
CoRR
V. Janaki, S. Madhan, T. C. Vijayaraghavan
2011 J jnl
The orbit problem is in the GapL hierarchy.
J. Comb. Optim.
Vikraman Arvind, T. C. Vijayaraghavan
2010 J jnl
A Note on Closure Properties of ModL.
Electron. Colloquium Comput. Complex.
T. C. Vijayaraghavan
2010 J jnl
Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes.
Comput. Complex.
Vikraman Arvind, T. C. Vijayaraghavan
2009 J jnl
Characterization of ModL using Prime Modulus.
Electron. Colloquium Comput. Complex.
T. C. Vijayaraghavan
2009 J jnl
Checking Equality of Matroid Linear Representations and the Cycle Matching Problem.
Electron. Colloquium Comput. Complex.
T. C. Vijayaraghavan
2008 Misc conf
The Orbit Problem Is in the GapL Hierarchy.
COCOON
Vikraman Arvind, T. C. Vijayaraghavan
2008 J jnl
The Orbit problem is in the GapL Hierarchy.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, T. C. Vijayaraghavan
2005 A conf
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.
CCC
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
2005 A conf
The Complexity of Solving Linear Equations over a Finite Ring.
STACS
Vikraman Arvind, T. C. Vijayaraghavan
2004 A conf
Abelian Permutation Group Problems and Logspace Counting Classes.
CCC
Vikraman Arvind, T. C. Vijayaraghavan
2004 J jnl
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan