As the question states, does the integer-factorization problem fall into the class of NP-Complete problems?
As the question states, does the integer-factorization problem fall into the class of NP-Complete
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
As the question states, does the integer-factorization problem fall into the class of NP-Complete problems?
Factoring:
The informal consensus/belief is that this is one of the “in-between” problems that are not in P and are not NP-complete. Of course, this belief is less strong and widely held than P≠NP.