281 search results - page 19 / 57 » The Proof Complexity of Linear Algebra |
126
click to vote
ENTCS
2008
15 years 3 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
139
Voted
ISSAC
1995
Springer
15 years 7 months ago
1995
Springer
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
130
click to vote
LPAR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
141
click to vote
Source Code
Armadillo is a streamlined C++ linear algebra library (matrix maths) aiming towards a good balance between speed and ease of use. It is based on recursive templates. Integer, float...
112
Voted
SIAMMAX
2011
14 years 10 months ago
2011
We introduce a methodology for obtaining inventories of error results for families of numerical dense linear algebra algorithms. The approach for deriving the analyses is goal-orie...