Complete Functional Proof of "P versus NP" Theorem

<p>After making the number of sufficient and successful experiments on account of "P versus NP" theorem, specifically according to the equivalence of complexity classes, we are giving the final and formal theoretical proof by contradiction in this paper summarizing all the results before and giving the definition of our functional hypothesis or conjecture, we will make the full proof and show that there exist mapping function for every NP-complete problem in the set that gives the sufficient proof of the relation between polynomial and non-polynomial classes</p>