V. Arvind

From MaRDI portal
Person:197718

Available identifiers

zbMath Open arvind.vikramanMaRDI QIDQ197718

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61924732024-02-12Paper
A note on the self-witnessing property of computational problems2024-01-29Paper
Equivalence Testing of Weighted Automata over Partially Commutative Monoids2023-08-08Paper
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)2023-05-05Paper
Efficient Black-Box Identity Testing for Free Group Algebras2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58756012023-02-03Paper
Fast Exact Algorithms Using Hadamard Product of Polynomials2023-02-03Paper
CNF satisfiability in a subspace and related problems2022-10-27Paper
On the Weisfeiler-Leman dimension of fractional packing2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50909392022-07-21Paper
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.2022-07-18Paper
Recognizing the Commuting Graph of a Finite Group2022-06-02Paper
Fast exact algorithms using Hadamard product of polynomials2022-03-25Paper
Univariate ideal membership parameterized by rank, degree, and number of generators2022-02-14Paper
Isomorphism testing of $k$-spanning tournaments is Fixed Parameter Tractable2022-01-28Paper
Parameterized complexity of small weight automorphisms and isomorphisms2022-01-18Paper
https://portal.mardi4nfdi.de/entity/Q49883012021-05-14Paper
On the Weisfeiler-Leman dimension of fractional packing2020-07-27Paper
On Weisfeiler-Leman invariance: subgraph counts and related graph properties2020-06-09Paper
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable2020-05-27Paper
On Weisfeiler-Leman invariance: subgraph counts and related graph properties2020-01-30Paper
Reductions to sets of low information content2019-12-04Paper
https://portal.mardi4nfdi.de/entity/Q49671522019-07-03Paper
https://portal.mardi4nfdi.de/entity/Q49671762019-07-03Paper
https://portal.mardi4nfdi.de/entity/Q49672192019-07-03Paper
https://portal.mardi4nfdi.de/entity/Q49672382019-07-03Paper
On the complexity of noncommutative polynomial factorization2018-09-27Paper
Expanding Generating Sets for Solvable Permutation Groups2018-07-20Paper
Parameterized Complexity of Small Weight Automorphisms.2018-04-19Paper
On the hardness of the noncommutative determinant2018-04-18Paper
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs2018-03-21Paper
Solvable black-box group problems are low for PP2017-11-16Paper
Graph isomorphism, color refinement, and compactness2017-10-18Paper
Finding fixed point free elements and small bases in permutation groups2017-06-13Paper
Complexity Theory Basics: NP and NL2016-09-22Paper
The parameterized complexity of geometric graph isomorphism2016-09-07Paper
Solving linear equations parameterized by Hamming weight2016-09-07Paper
Sparse sets, approximable sets, and parallel queries to NP2016-06-16Paper
On the Power of Color Refinement2015-09-29Paper
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP2015-09-24Paper
On the complexity of noncommutative polynomial factorization2015-09-16Paper
On Tinhofer’s Linear Programming Approach to Isomorphism Testing2015-09-16Paper
Solving Linear Equations Parameterized by Hamming Weight2015-09-15Paper
The Parameterized Complexity of Geometric Graph Isomorphism2015-09-15Paper
Uniform derandomization from pathetic lower bounds2015-08-21Paper
On the isomorphism problem for decision trees and decision lists2015-06-10Paper
Colored hypergraph isomorphism is fixed parameter tractable2015-03-02Paper
Isomorphism testing of Boolean functions computable by constant-depth circuits2014-11-28Paper
Testing nilpotence of galois groups in polynomial time2014-09-09Paper
On the hardness of the noncommutative determinant2014-08-13Paper
The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups2013-12-10Paper
The parallel complexity of graph canonization under abelian group action2013-11-11Paper
Comments on ``Arithmetic complexity, Kleene closure, and formal power series2013-10-21Paper
On the Isomorphism Problem for Decision Trees and Decision Lists2013-08-16Paper
https://portal.mardi4nfdi.de/entity/Q49041052013-01-28Paper
Arithmetic Circuits and the Hadamard Product of Polynomials2012-10-24Paper
Some Sieving Algorithms for Lattice Problems2012-10-19Paper
The isomorphism problem for \(k\)-trees is complete for logspace2012-10-11Paper
Approximate Graph Isomorphism2012-09-25Paper
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups2012-09-25Paper
COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable2012-08-29Paper
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs2012-06-29Paper
Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits2012-06-08Paper
QUANTUM QUERY COMPLEXITY OF MULTILINEAR IDENTITY TESTING2012-04-24Paper
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets2012-01-23Paper
Canonizing Hypergraphs under Abelian Group Action2011-08-17Paper
The orbit problem is in the GapL hierarchy2011-02-18Paper
New results on noncommutative and commutative polynomial identity testing2011-02-18Paper
Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes2011-02-07Paper
Uniform Derandomization from Pathetic Lower Bounds2010-09-10Paper
Isomorphism and canonization of tournaments and hypertournaments2010-08-18Paper
The complexity of exactly learning algebraic concepts2010-04-27Paper
The ideal membership problem and polynomial identity testing2010-04-08Paper
On Lower Bounds for Constant Width Arithmetic Circuits2009-12-17Paper
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach2009-11-27Paper
Parameterized learnability of juntas2009-11-06Paper
Arithmetic Circuits, Monomial Algebras and Finite Automata2009-10-16Paper
https://portal.mardi4nfdi.de/entity/Q33965582009-09-19Paper
Algorithms and Computation2009-08-07Paper
Algorithms and Computation2009-08-07Paper
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size2008-11-27Paper
https://portal.mardi4nfdi.de/entity/Q35224912008-09-03Paper
Parameterized Learnability of k-Juntas and Related Problems2008-08-19Paper
The Orbit Problem Is in the GapL Hierarchy2008-07-10Paper
SZK proofs for black-box group problems2008-06-17Paper
A Logspace Algorithm for Partial 2-Tree Canonization2008-06-05Paper
The Monomial Ideal Membership Problem and Polynomial Identity Testing2008-05-27Paper
The Space Complexity of k-Tree Isomorphism2008-05-27Paper
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem2008-04-24Paper
On Isomorphism and Canonization of Tournaments and Hypertournaments2008-04-24Paper
On Hypergraph and Graph Isomorphism with Bounded Color Classes2008-03-19Paper
Algorithmic Problems for Metrics on Permutation Groups2008-03-07Paper
The Complexity of Black-Box Ring Problems2007-09-10Paper
A Polynomial Time Nilpotence Test for Galois Groups and Related Results2007-09-05Paper
SZK Proofs for Black-Box Group Problems2007-05-02Paper
Graph Isomorphism is in SPP2006-06-30Paper
https://portal.mardi4nfdi.de/entity/Q33720632006-02-17Paper
STACS 20052005-12-02Paper
Algorithmic Number Theory2005-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44278672003-09-14Paper
Arithmetic complexity, Kleene closure, and formal power series2003-08-26Paper
https://portal.mardi4nfdi.de/entity/Q44839152003-05-27Paper
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes.2003-05-14Paper
Numerical Analysis of Optical Fibers With Arbitrary Refractive Index Profile2002-08-01Paper
On pseudorandomness and resource-bounded measure2001-08-20Paper
A nonadaptive NC checker for permutation group intersection2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45015532001-06-13Paper
The Complexity of Modular Graph Automorphism2001-03-19Paper
https://portal.mardi4nfdi.de/entity/Q45256942001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q45112212000-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45015422000-09-04Paper
Exact learning via teaching assistants2000-08-21Paper
The counting complexity of group-definable languages2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q42510592000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42603741999-09-19Paper
https://portal.mardi4nfdi.de/entity/Q42566491999-08-08Paper
https://portal.mardi4nfdi.de/entity/Q42467571999-06-15Paper
Constructivizing Membership Proofs in Complexity Classes1998-07-27Paper
Solvable black-box group problems are low for PP1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43813871998-07-16Paper
https://portal.mardi4nfdi.de/entity/Q43700341998-05-25Paper
A note on decision versus search for graph automorphism1997-11-12Paper
Monotonous and randomized reductions to sparse sets1997-04-29Paper
If NP has polynomial-size circuits, then MA=AM1997-02-28Paper
Geometric sets of low information content1997-02-27Paper
Quasi-linear truth-table reductions to \(p\)-selective sets1997-02-27Paper
Upper bounds for the complexity of sparse and tally descriptions1996-02-20Paper
ON HELPING AND INTERACTIVE PROOF SYSTEMS1995-10-29Paper
https://portal.mardi4nfdi.de/entity/Q42814911994-03-10Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: V. Arvind