A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"
Moustapha DiabyPublished in: CoRR (2007)
Keyphrases
- np complete problems
- np complete
- graph coloring
- phase transition
- suboptimal solutions
- random instances
- hard problems
- linear programming
- randomly generated
- computational complexity
- optimal solution
- combinatorial problems
- sat problem
- neural network
- special case
- job shop scheduling
- cost function
- linear program
- decision problems