15644 search results - page 215 / 3129 » Brittle System Analysis |
191
click to vote
MYCRYPT
2005
Springer
16 years 20 days 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 ....
