Why LP Cannot Solve Large Instances of NP-complete Problems in Polynomial Time

Radoslaw Hofman. Why LP Cannot Solve Large Instances of NP-complete Problems in Polynomial Time. In Sio Iong Ao, Oscar Castillo, Craig Douglas, David Dagan Feng, Jeong-A. Lee, editors, Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, IMECS 2007, March 21-23, 2007, Hong Kong, China. Lecture Notes in Engineering and Computer Science, pages 596-599, Newswood Limited, 2007.

Abstract

Abstract is missing.