Data Structures and Algorithms

P! = NP — Final Proof of the Millennium Theorem

Authors: Mirzakhmet Syzdykov
Comments: 3 Pages.

We state that if there's an order in the target function for the set of variables, then P != NP according to the dynamic programming which is the most optimal way of solving the combinatorial problems using its recurrent function at each step of the algorithm.
Category: Data Structures and Algorithms