Demystifying Karp’s 21 Original NP-Complete Problems
The purpose of this research project was to find a simple cycle of reductions among the 21 NP-Complete that Richard M. Karp identified in his paper “Reducibility Among Combinatorial Problems”. To create our cycle, we used Karp’s form of reductions. While we were able to discover several original reductions, we were not able to find a simple cycle among the problems. However, we believe that a simple cycle is still possible, it will just require more time and brain power.