1 citations · 2 across the 5 of their papers we have counts for
5 papers · 1 filter
Deterministic Constructions of Reed-Solomon Codes Beyond the Johnson Bound
Abhranil Chatterjee, Sumanta Ghosh, Zeyu Guo +2
We give a deterministic quasipolynomial-time construction of Reed-Solomon codes that are list-decodable beyond the Johnson radius. Specifically, for every and all suffi…
Learning Read-Once Determinants and the Principal Minor Assignment Problem
Abhiram Aravind, Abhranil Chatterjee, Sumanta Ghosh +3
A symbolic determinant under rank-one restriction computes a polynomial of the form , where are square matrices over a field $\…
Characterizing and Testing Principal Minor Equivalence of Matrices
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar +1
Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence an…
Fractional Linear Matroid Matching is in quasi-NC
Rohit Gurjar, Taihei Oki, Roshan Raj
The matching and linear matroid intersection problems are solvable in quasi-NC, meaning that there exist deterministic algorithms that run in polylogarithmic time and use quasi-pol…
Border Complexity of Symbolic Determinant under Rank One Restriction
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar +1
VBP is the class of polynomial families that can be computed by the determinant of a symbolic matrix of the form where the size of each is polynom…