736 search results - page 66 / 148 » Algorithms for Ordinal Arithmetic |
SMA
2005
ACM
14 years 1 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
EUROCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
PKC
1999
Springer
13 years 12 months ago
1999
Springer
Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottle...
ASAP
1997
IEEE
13 years 12 months ago
1997
IEEE
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
SPAA
1990
ACM
13 years 11 months ago
1990
ACM
We introduce a new preconditioner for solving a symmetric Toeplitz system of equations by the conjugate gradient method. This choice leads to an algorithm which is particularly sui...