5 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.CC2008
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…
math.LO2007★ 3 cited
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…
cs.CC2006★ 5 cited
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…