5 citations · 15 across the 11 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.CC2006★ 4 cited
The Computational Complexity of the Traveling Salesman Problem
Craig Alan Feinstein
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
cs.CC2006★ 2 cited
An Elegant Argument that P is not NP
Craig Alan Feinstein
In this note, we present an elegant argument that P is not NP by demonstrating that the Meet-in-the-Middle algorithm must have the fastest running-time of all deterministic and exa…