The Proof Complexity of Linear Algebra. Soltys, M. and Cook, S. A. In Proceedings of Logic in Computer Science (LICS), pages 335-344, 2002.
The Proof Complexity of Linear Algebra [link]Paper  bibtex   
@inproceedings{ dblp3504447,
  title = {The Proof Complexity of Linear Algebra},
  author = {Michael Soltys and Stephen A. Cook},
  author_short = {Soltys, M. and Cook, S. A.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2002},
  key = {dblp3504447},
  id = {dblp3504447},
  biburl = {http://www.dblp.org/rec/bibtex/conf/lics/SoltysC02},
  url = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029841},
  conference = {LICS},
  pages = {335-344},
  text = {LICS 2002:335-344},
  booktitle = {Proceedings of Logic in Computer Science (LICS)}
}
Downloads: 0