Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

LICS
2002
IEEE

favoriteEmaildiscussreport

84views Automated Reasoning» more LICS 2002»

The Proof Complexity of Linear Algebra

13 years 9 months ago

The Proof Complexity of Linear Algebra

Download www.cas.mcmaster.ca

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 ﬁrst feasible proofs of the Cayley-Hamilton theorem and other properties of the determinant, and study the propositional proof complexity of matrix identities.

Michael Soltys, Stephen A. Cook

Real-time Traffic

Automated Reasoning | Formal Theories | LICS 2002 | Propositional Proof Complexity | ﬁrst Feasible Proofs |

claim paper

Related Content

» Feasible Proofs of Matrix Properties with Csankys Algorithm

» Algebraic Proofs over Noncommutative Formulas

» The Algebra of Equality Proofs

» The proof theoretic strength of the Steinitz exchange theorem

» On the complexity of division and set joins in the relational algebra

» Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

» From Focalization of Logic to the Logic of Focalization

» Eigenvectors and Reconstruction

» Lower bounds for adaptive linearity tests

Post Info
More Details (n/a)

Added	15 Jul 2010
Updated	15 Jul 2010
Type	Conference
Year	2002
Where	LICS
Authors	Michael Soltys, Stephen A. Cook

Comments (0)