Visualizing NP-completeness through circuit-based widgets
Steven R. Vegdahl · Journal of computing sciences in colleges · 2014
The concept of intractability is an important one in a CS curriculum. Students should know that some problems are computationally infeasible; ideally, they should have the ability to examine a problem and determine whether it is intractable. This paper presents two widgets that help students gain better intuition about NP-completeness. Each maps circuit satisfiability to a target problem in a visually intuitive way.