๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The proof complexity of linear algebra

โœ Scribed by Michael Soltys; Stephen Cook

Book ID
108054550
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
678 KB
Volume
130
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimization complexity of linear logic
Optimization complexity of linear logic proof games
โœ Patrick D. Lincoln; John C. Mitchell; Andre Scedrov ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 218 KB

A class of linear logic proof games is developed, each with a numeric score that depends on the number of preferred axioms used in a complete or partial proof tree. The complexity of these games is analyzed for the NP-complete multiplicative fragment (MLL) extended with additive constants and the PS

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
โœ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

The Complexity of Local Proof Search in
The Complexity of Local Proof Search in Linear Logic: (Extended Abstract)
โœ Patrick D. Lincoln; John C. Mitchell; Andre Scedrov ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 473 KB

Proof search in linear logic is known to be di cult: the provability of propositional linear logic formulas is undecidable. Even without the modalities, multiplicativeadditive fragment of propositional linear logic, mall, i s k n o wn to be pspace-complete, and the pure multiplicative fragment, mll,