Sciweavers

171 search results - page 8 / 35
» Weak theories of linear algebra
Sort
View
RC
2002
96views more  RC 2002»
13 years 6 months ago
Verification of Invertibility of Complicated Functions over Large Domains
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
Jens Hoefkens, Martin Berz
CSL
2010
Springer
13 years 7 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
TIT
2011
169views more  TIT 2011»
13 years 1 months ago
Network Coding Theory Via Commutative Algebra
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
Shuo-Yen Robert Li, Qifu Tyler Sun
FSE
2004
Springer
82views Cryptology» more  FSE 2004»
13 years 10 months ago
Resistance of S-Boxes against Algebraic Attacks
Abstract. We develop several tools to derive linear independent multivariate equations from algebraic S-boxes. By applying them to maximally nonlinear power functions with the inve...
Jung Hee Cheon, Dong Hoon Lee 0002
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 5 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra