loading...
The Proof Complexity of Linear Algebra
Copenhagen, Denmark July 22-July 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2002.102984117th Annual IEEE Symposium on Logic i ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Michael Soltys, Stephen Cook, "The Proof Complexity of Linear Algebra," Logic in Computer Science, Symposium on, pp. 335, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2002.1029841,
author = {Michael Soltys and Stephen Cook},
title = {The Proof Complexity of Linear Algebra},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2002},
issn = {1043-6871},
pages = {335},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029841},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - The Proof Complexity of Linear Algebra
SN - 1043-6871
SP
EP
A1 - Michael Soltys,
A1 - Stephen Cook,
PY - 2002
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Michael Soltys, McMaster University
Stephen Cook, University of Toronto
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.
Citation:
Michael Soltys, Stephen Cook, "The Proof Complexity of Linear Algebra," lics, pp.335, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.