KIT | KIT-Bibliothek | Impressum | Datenschutz

Using interactive visualization for teaching the theory of NP-completeness

Pape, Christian

Abstract:

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.

Open Access Logo


Volltext §
DOI: 10.5445/IR/65597
Coverbild
Zugehörige Institution(en) am KIT Institut für Logik, Komplexität und Deduktionssysteme (ILKD)
Publikationstyp Buch
Jahr 1997
Sprache Englisch
Identifikator urn:nbn:de:swb:90-AAA655971
KITopen-ID: 65597
Erscheinungsvermerk Karlsruhe 1997. (Interner Bericht. Fakultät für Informatik, Universität Karlsruhe. 1997,30.)
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page