4 citations · 13 across the 12 of their papers we have counts for
Showing 2021 · cs.CCShow all
2 papers · 2 filters
cs.CC2021
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles
Samir Datta, Kishlaya Jaiswal
We present a parallel algorithm for permanent mod 2^k of a matrix of univariate integer polynomials. It places the problem in ParityL subset of NC^2. This extends the techniques of…
cs.CC2021
Reachability and Matching in Single Crossing Minor Free Graphs
Samir Datta, Chetan Gupta, Rahul Jain +3
We show that for each single crossing graph , a polynomially bounded weight function for all -minor free graphs can be constructed in Logspace such that it gives nonzero…