281 search results - page 5 / 57 » The Proof Complexity of Linear Algebra |
ENTCS
2008
13 years 8 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
CRYPTO
1999
Springer
14 years 5 days ago
1999
Springer
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...