Computer Science Logic

DOI10.1007/11538363zbMath1136.03335OpenAlexW2479351976MaRDI QIDQ5394597

Michael Soltys

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538363

zbMATH Keywords

proof complexity, Csanky's algorithm, matrix algebra

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Eigenvalues, singular values, and eigenvectors (15A18) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Related Items (2)

The proof theoretic strength of the Steinitz exchange theorem ⋮ Short Proofs for the Determinant Identities

This page was built for publication: Computer Science Logic