activity
20062008
most citedReport on article: P=NP Linear programming formulation of the Traveling Salesman Problem

5 citations · 8 across the 3 of their papers we have counts for

collaborators
Showing math.LOShow all

1 paper · 1 filter

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…