I have found a solution. By modeling the problem as a graph represented with an adjacency matrix, I can find the optimum path with only elementary row reduction and matrix multiplication. I will be keeping my discovery proprietary for now to continue searching for bugs, but please sing my praises and congratulate me on this world-changing discovery.
Name:
God2014-09-18 3:08
I have further reduced the solution to operate in only O(0.5n). Furthermore, I have generalized the problem class to cover all of the class of NP.
Yes, it is true. You have heard that correctly. Yes, I have verified my proof. I can say without a doubt that P=NP. I have a proof-of-concept that allows for the factoring of integers in O(2). I have also developed a sorting algorithm that can sort in-place in only O(7). I have decided to delay releasing my proof and algorithms to allow the world, specifically security, to catch up to my new discovery.