Uniform, integral and efficient proofs for the determinant identities

MaRDI QIDQ5144645zbMATH OpenFDO

Authors Iddo Tzameret, Stephen Cook

Publication date 19 January 2021

Full work available at URL http://dl.acm.org/citation.cfm?id=3330034

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Determinants, permanents, traces, other special matrix functions (15A15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Uniform, Integral, and Feasible Proofs for the Determinant Identities
• Short proofs for the determinant identities
• The proof complexity of linear algebra
• Algebras with Polynomial Identities and Computing the Determinant
• Deterministic polynomial identity testing in non-commutative models

Cited in

(7)

• Alternative proofs of some formulas for two tridiagonal determinants
• A high-tech proof of the Mills-Robbins-Rumsey determinant formula
• Characterizing propositional proofs as noncommutative formulas
• Uniform, Integral, and Feasible Proofs for the Determinant Identities
• Short Proofs for the Determinant Identities
• Short proofs for the determinant identities
• Formal theories for linear algebra

This page was built for publication: Uniform, integral and efficient proofs for the determinant identities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144645)