12373 search results - page 7 / 2475 » Semi-Logarithmic Number Systems |
FCCM
2005
IEEE
15 years 8 months ago
2005
IEEE
115
click to vote
MYCRYPT
2005
Springer
15 years 8 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
15 years 8 months ago
2004
Springer
