5 citations · 13 across the 4 of their papers we have counts for
4 papers
Report on article The Travelling Salesman Problem: A Linear Programming Formulation
Radoslaw Hofman
This article describes counter example prepared in order to prove that linear formulation of TSP problem proposed in [arXiv:0803.4354] is incorrect (it applies also to QAP problem…
Complexity Considerations, cSAT Lower Bound
Radoslaw Hofman
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some trans…
Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time
Radoslaw Hofman
This article discusses ability of Linear Programming models to be used as solvers of NP-complete problems. Integer Linear Programming is known as NP-complete problem, but non-integ…
Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem
Radoslaw Hofman
This article presents counter examples for three articles claiming that P=NP. Articles for which it applies are: Moustapha Diaby "P = NP: Linear programming formulation of the trav…