237 search results - page 13 / 48 » MapReduce for Integer Factorization |
ENTCS
2006
13 years 9 months ago
2006
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
COMBINATORICS
1999
13 years 9 months ago
1999
![A [k, k+1]-Factor Containing A Given Hamiltonian Cycle](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/a_k_k_1_factor_containing_a_given_hamiltonian_cycle_COMBINATORICS_1999.jpg "A [k, k+1]-Factor Containing A Given Hamiltonian Cycle")
We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k - 16 for even n and n 6k-13 for odd n...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
CC
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
MOC
2010
13 years 4 months ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...