Guest wrote:FYI: "P versus NP problem",
https://en.wikipedia.org/wiki/P_versus_NP_problem.
Is P = NP? "We do not know!"
Guest wrote:Hmm. We shall go against established
beliefs... We claim P = PN (The world is exceedly beautiful! Thank and praise Lord GOD! Amen!). And we claim our proof will be constructive and quite technical too.
Moreover, we expect a definitive proof, affirmative or negative, soon (within 12 months in honor/praise of Lord GOD. Amen!).
Update wrote:Hmm. We shall go against established beliefs... We claim P = NP (The world is exceedingly beautiful! Thank and praise Lord GOD! Amen!). And we claim our proof will be constructive and quite technical too.
Moreover, we expect a definitive proof, affirmative or negative, soon (within 12 months in honor/praise of Lord GOD. Amen!).
Guest wrote:FYI: 'Chapter 17: Limits to Computation' by Prof. C. A. Shaffer is quite good! Enjoy!
Source Link: https://people.cs.vt.edu/shaffer/Book/Java3e20110103.pdf.
Guest wrote:Can we construct a polynomial-time algorithm that solves TSP (Travelling Salesman Problem)?
Reference Links: https://en.wikipedia.org/wiki/Travelling_salesman_problem#Computational_complexity;
...
Guest wrote:FYI: 'A (Slightly) Improved Approximation Algorithm for Metric TSP' by Profs. A. R. Karlin et al.,
https://arxiv.org/pdf/2007.01409.pdf. Good work!
Guest wrote:Guest wrote:Can we construct a polynomial-time algorithm that solves TSP (Travelling Salesman Problem)?
Reference Links: https://en.wikipedia.org/wiki/Travelling_salesman_problem#Computational_complexity;
...
FYI: "At last! There’s an algorithm that’s closer than ever to solving the traveling salesperson problem."
https://thenextweb.com/news/at-last-theres-an-algorithm-thats-closer-than-ever-to-solving-the-traveling-salesperson-problem.
Guest wrote:Remark: Hmm. If our reasoning for the previous post is correct, we should be able to formulate a polynomial-time algorithm that solves TSP.
Users browsing this forum: No registered users and 1 guest