1 citations · 2 across the 17 of their papers we have counts for
18 papers
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…
Trading Determinism for Noncommutativity in Edmonds' Problem
V. Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Let be a partitioned set of variables such that the variables in each part are noncommuting but for any , the variables $x\in…
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
V. Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Rational Identity Testing (RIT) is the decision problem of determining whether or not a noncommutative rational formula computes zero in the free skew field. It admits a determinis…
Recursive Error Reduction for Regular Branching Programs
Eshan Chattopadhyay, Jyun-Jie Liao
In a recent work, Chen, Hoza, Lyu, Tal and Wu (FOCS 2023) showed an improved error reduction framework for the derandomization of regular read-once branching programs (ROBPs). Thei…
On Lifting Lower Bounds for Noncommutative Circuits using Automata
V. Arvind, Abhranil Chatterjee
We revisit the main result of Carmosino et al \cite{CILM18} which shows that an size noncommutative arithmetic circuit size lower bound (where is the matrix mult…