A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Using interactive visualization for teaching the theory of NP-completeness
[book]
1997
Preserved Fulltext
In this paper we investigate the potential of interactive visualization for teaching the theory of NP-completeness to undergraduate students of computer science. Based on this analysis we developed some interactive Java applets which we use to present an NP-complete tiling problem PUZZLE in our lecture. This software is integrated into our hypertext lecture notes and our students also use it to find an NP-completeness proof for PUZZLE as an exercise.
doi:10.5445/ir/65597
fatcat:w77oosp6irfhrgwewcws44ffde