Moustapha Diaby On the Equality of Complexity Classes P and NP: Linear Programming Formulation of the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP] IMECS, 2006, pp:774-779 [Conf]
Moustapha Diaby A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time" [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
Moustapha Diaby On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example" [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Moustapha Diaby Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]