The Community for Technology Leaders
Logic in Computer Science, Symposium on (2002)
Copenhagen, Denmark
July 22, 2002 to July 25, 2002
ISSN: 1043-6871
ISBN: 0-7695-1483-9
pp: 335
Stephen Cook , University of Toronto
Michael Soltys , McMaster University
ABSTRACT
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We give what is apparently the first feasible proofs of the Cayley-Hamilton theorem and other properties of the determinant, and study the propositional proof complexity of matrix identities.
INDEX TERMS
null
CITATION
Stephen Cook, Michael Soltys, "The Proof Complexity of Linear Algebra", Logic in Computer Science, Symposium on, vol. 00, no. , pp. 335, 2002, doi:10.1109/LICS.2002.1029841
108 ms
(Ver )