2 papers
cs.LO2025
On matrix rank function over bounded arithmetics
Eitetsu Ken, Satoru Kuroda
In [Mulmuley, 1987], Mulmuley gave an algorithm reducing the computation of the matrix rank function to that of determinants, of which the proof for the verification is elementary.…
math.LO2024
Formalizing Pfaffian in bounded arithmetic
Satoru Kuroda
We formalize algorithms computing Pfaffian in the theory of bounded arithmetic for sharpL which is based on Berkowitz algorithm for the determinant. We also prove relations among P…