Is the integer-factorization problem (used for many cryptographic applications) NP-Complete?

Posted by Gail on Stack Overflow See other posts from Stack Overflow or by Gail
Published on 2010-04-15T03:03:58Z Indexed on 2010/04/15 3:13 UTC
Read the original article Hit count: 176

Filed under:

As the question states, does the integer-factorization problem fall into the class of NP-Complete problems?

© Stack Overflow or respective owner

Related posts about computer-science