Stanford professor, Tim Roughgarden’s video lectures on algorithmic game theory (AGT) ]]>

To truly love Badminton is to put aside the trivial stuff that goes around every now and then. People that are and have been passionate about the sport understand exactly what I’m saying here. Just get to know it by playing it to the fullest and watching the best in the world perform whether it’s on you tube or if you’re fortunate enough to watch them live. You will be a big fan if you’re not one already. Let it get a grip on you, it’s wonderful. ]]>

I have found a new complexity class that I called “equivalent-P” and I have showed it has a close relation with the P versus NP Problem. I have been making a paper that explain my ideas, and in the meantime, I decided to share them as a preprint in the web.

Here, I show you the abstract of the paper (so you can capture the idea):

“The P versus NP problem is one of the most important and unsolved problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? This incognita was first mentioned in a letter written by Kurt Gödel to John von Neumann in 1956. However, the precise statement of the P versus NP problem was introduced in 1971 by Stephen Cook in a seminal paper. We consider a new complexity class, called equivalent-P, which has a close relation with this problem. The class equivalent-P has those languages that contain ordered pairs of instances, where each one belongs to a specific problem in P, such that the two instances share a same solution, that is, the same certificate. We demonstrate that equivalent-P = NP and equivalent-P = P. In this way, we find the solution of P versus NP problem, that is, P = NP.”

In this preprint, I shall show that there is an NP-complete problem in equivalent-P and a P-complete problem in equivalent-P. Moreover, I shall show the complexity class equivalent-P is closed under reductions. Since P and NP are also closed under reductions, then we can conclude that P = NP.

You can read more on:

https://hal.archives-ouvertes.fr/hal-01161668/document

Kind regards,

Frank.

Moreover, could you please clarify what publications are constituted as a EC-comparable venues?

]]>