2452 search results - page 133 / 491 » On Reduction of Lagrange Systems |
157
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
176
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
183
click to vote
IACR
2011
14 years 5 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
161
click to vote
USENIX
1994
15 years 7 months ago
1994
With the advent and subsequent popularity of portable computers, power management of system components has become an important issue. Current portable computers implement a number...
160
click to vote
TCS
2008
15 years 5 months ago
2008
We describe a type system for the Xd calculus of Gardner and Maffeis. An Xd-network is a network of locations, where each location consists of both a data tree (which contains scr...