We prove P = NP by showing that Integer Factorization is NP-Complete and that Shor's algorithm solves it in O (\ n).
יהוה et al. (Wed,) studied this question.