About the impossibility to prove P=NP and the pseudo-randomness in NP

M. Rémon

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP…