5 citations · 15 across the 11 of their papers we have counts for
5 papers · 1 filter
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.
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…
Complexity Science for Simpletons
Craig Alan Feinstein
In this article, we shall describe some of the most interesting topics in the subject of Complexity Science for a general audience. Anyone with a solid foundation in high school ma…
Machine-Checked Formalization of Earlier Arguments on versus Using Isabelle/HOL
Craig Alan Feinstein
This letter revisits an earlier argument concerning versus based on the SUBSET-SUM problem and examines its formalization in Isabelle/HOL. The formal dev…
A mathematical definition of "simplify"
Craig Alan Feinstein
Even though every mathematician knows intuitively what it means to "simplify" a mathematical expression, there is still no universally accepted rigorous mathematical definition of…