Question

Can integer factorization be done in polynomial time on a classical (non-quantum) computer?

Answer 1

Explanation:

i dont think so we can do

Answer 2

Answer:

This is still an open problem, so no one knows if it can be done in polynomial time in the worst case. However, it is very likely that integer factorization is strongly polynomial. It is also well known that there is a polynomial time algorithm for integer factorization on quantum computers Shor's algorithm.

HOPE IT HELPS YOU

PLEASE MARK ME AS THE BRAINLIEST