| |
| 2007 | ||
|---|---|---|
| 4 | Radoslaw Hofman: Complexity Considerations, cSAT Problem Lower Bound. IMECS 2007: 451-458 | |
| 3 | Radoslaw Hofman: Why LP Cannot Solve Large Instances of NP-complete Problems in Polynomial Time. IMECS 2007: 596-599 | |
| 2006 | ||
| 2 | EE | Radoslaw Hofman: Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem CoRR abs/cs/0610125: (2006) |
| 1 | EE | Radoslaw Hofman: Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time CoRR abs/cs/0611008: (2006) |