Komponenta výukového serveru TI - NP-úplné problémy 2
Loading...
Downloads
0
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská – Technická univerzita Ostrava
Location
Signature
Abstract
This thesis deals with the complexity theory of algorithms with focus on NP-complete problems.
Key tools for studying these problems are polynomial reductions,
which allow transforming instances of one problem to instances of another.
Understanding reductions is often challenging due to their abstract nature
and the lack of interactive tools.
The goal of this thesis is to design and implement a web application
that enables interactive visualization of polynomial reductions
between selected NP-complete problems.
The application allows users to input their own problem instances,
perform reductions, view step-by-step explanations,
and visualize solutions.
The result is an interactive educational tool
that connects theoretical concepts with practical implementation.
Description
Delayed publication
Available after
Subject(s)
NP-complete problems, polynomial reductions, computational complexity, interactive visualization, educational tool