ARTÍCULO
TITULO

A Deterministic Polynomial-Time Algorithm for Heilbronn s Problem in Three Dimensions

Lefmann    
H. Schmitt    
N.    

Resumen

No disponible

 Artículos similares

       
 
Ade Candra, Mohammad Andri Budiman, Dian Rachmawati     Pág. 30 - 37
It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a... ver más