Journal of Computing Sciences in Colleges
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.
Author Supplied Keywords
Computer science--Study and teaching; Computational complexity
Citation: Pilot Scholars Version (Modified MLA Style)
Vegdahl, Steven R., "VISUALIZING NP-COMPLETENESS THROUGH CIRCUIT-BASED WIDGETS" (2016). Engineering Faculty Publications and Presentations. Paper 28.