Factorisation is very, very, very unlikely to be NP-complete. P is a separate class from the class of problems considered efficiently solvable; BQP is the clas

Factorisation is very, very, very unlikely to be NP-complete. P is a separate class from the class of problems considered efficiently solvable; BQP is the class of problems that are efficiently solved by quantum computers, and it is believed that BQP is strictly larger than P.