29 citations · 35 across the 10 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2013
Feasible combinatorial matrix theory
Ariel Fernández, Michael Soltys
We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restric…
cs.LO2005★ 2 cited
Feasible Proofs of Matrix Properties with Csanky's Algorithm
Michael Soltys
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP…