3 ms·
Factorization is very likely not NP-complete, so that particular example doesn't generalize to the rest of NP. In fact, any computer can solve an NP problem in
by ravi-delia 6y ago
Factorization is very likely not NP-complete, so that particular example doesn't generalize to the rest of NP. In fact, any computer can solve an NP problem in P: Just pick a problem in P of your choice! Every problem in P is also in NP.