281 search results - page 9 / 57 » The Proof Complexity of Linear Algebra |
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
ENTCS
2006
13 years 8 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
MP
2010
13 years 2 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...