12373 search results - page 7 / 2475 » Semi-Logarithmic Number Systems |
FCCM
2005
IEEE
14 years 1 months ago
2005
IEEE
MEMBRANE
2005
Springer
14 years 1 months ago
2005
Springer
MYCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
SACRYPT
2004
Springer
14 years 25 days ago
2004
Springer
DAGM
2003
Springer
14 years 22 days ago
2003
Springer
