4 papers
Fast exact algorithms via the Matrix Tree Theorem
V. Arvind, Srijan Chakraborty, Samir Datta +1
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each othe…
Derandomizing Isolation In Catalytic Logspace
V. Arvind, Srijan Chakraborty, Samir Datta
A language is said to be in catalytic logspace if we can test membership using a deterministic logspace machine that has an additional read/write tape filled with arbitrary data wh…
Revisiting Tree Canonization using polynomials
V. Arvind, Samir Datta, Salman Faris +1
Graph Isomorphism (GI) is a fundamental algorithmic problem. Amongst graph classes for which the computational complexity of GI has been resolved, trees are arguably the most funda…
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem
V. Arvind, Samir Datta, Asif Khan +3
Let be a finite group given as input by its multiplication table. For a subset of and an element the Cayley Group Membership Problem (denoted CGM) is to check…