281 search results - page 18 / 57 » The Proof Complexity of Linear Algebra |
FSE
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. For unstuttered SOBER-t32, two different attacks are implemented. In the first attack, we obt...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
: We review the singular value decomposition (SVD) and discuss some lesser-known applications of it that we find particularly interesting. We also discuss generalizations of the S...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
AISC
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
JSC
2007
13 years 7 months ago
2007
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...