The following pages link to Vikraman Arvind (Q197718):
Displaying 50 items.
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- The parameterized complexity of geometric graph isomorphism (Q309786) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Comments on ``Arithmetic complexity, Kleene closure, and formal power series'' (Q372962) (← links)
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- Isomorphism testing of Boolean functions computable by constant-depth circuits (Q476155) (← links)
- Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes (Q623500) (← links)
- The orbit problem is in the GapL hierarchy (Q626456) (← links)
- New results on noncommutative and commutative polynomial identity testing (Q626693) (← links)
- If NP has polynomial-size circuits, then MA=AM (Q674343) (← links)
- A note on decision versus search for graph automorphism (Q675067) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- SZK proofs for black-box group problems (Q929290) (← links)
- The ideal membership problem and polynomial identity testing (Q963063) (← links)
- Isomorphism and canonization of tournaments and hypertournaments (Q988566) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469) (← links)
- Solvable black-box group problems are low for PP (Q1390854) (← links)
- Arithmetic complexity, Kleene closure, and formal power series (Q1405781) (← links)
- Exact learning via teaching assistants (Q1575459) (← links)
- The counting complexity of group-definable languages (Q1575546) (← links)
- On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- Parameterized complexity of small weight automorphisms and isomorphisms (Q2067668) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- Finding fixed point free elements and small bases in permutation groups (Q2357380) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- The complexity of modular graph automorphism (Q2706110) (← links)
- Numerical analysis of optical fibers with arbitrary refractive index profile (Q2763716) (← links)
- Some lower bound results for set-multilinear arithmetic computations (Q2808533) (← links)
- Complexity Theory Basics: NP and NL (Q2821692) (← links)
- On the Isomorphism Problem for Decision Trees and Decision Lists (Q2842768) (← links)
- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups (Q2867068) (← links)
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (Q2890182) (← links)
- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs (Q2894451) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2908862) (← links)
- Approximate Graph Isomorphism (Q2912712) (← links)
- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups (Q2912713) (← links)
- Arithmetic circuits and the Hadamard product of polynomials (Q2920110) (← links)
- The Complexity of Bounded Register and Skew Arithmetic Computation (Q2920493) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- Solving Linear Equations Parameterized by Hamming Weight (Q2946006) (← links)
- The Parameterized Complexity of Geometric Graph Isomorphism (Q2946007) (← links)
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing (Q2946374) (← links)
