281 search results - page 12 / 57 » The Proof Complexity of Linear Algebra |
WCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The recently developed algebraic attacks apply to all keystream generators whose internal state is updated by a linear transition function, including LFSR-based generator...
IPPS
1998
IEEE
14 years 5 days ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...