1083 search results - page 1 / 217 » On the Number of Optimal Base 2 Representations of Integers |
DCC
2006
IEEE
14 years 5 months ago
2006
IEEE
JUCS
2002
13 years 5 months ago
2002
: Let b 2 be an integer. A real number is called simply normal to base b if in its representation to base b every digit appears with the same asymptotic frequency. We answer the f...
CHES
2007
Springer
14 years 10 days ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
EJC
2011
13 years 1 months ago
2011
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N-tuple is defined to be the largest positive integer that has no re...
IPCO
2007
13 years 7 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...