Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem
A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem
A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"
Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
Linear Programming Formulation of the Boolean Satisfiability Problem
No associations
LandOfFree
Moustapha Diaby does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Moustapha Diaby, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Moustapha Diaby will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-156652