171 search results - page 6 / 35 » Weak theories of linear algebra |
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
AML
2006
13 years 6 months ago
2006
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
CSL
2005
Springer
14 years 7 days ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
ICMLA
2008
13 years 8 months ago
2008
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...