Server pro podporu výuky teoretické informatiky

Abstract

This diploma thesis describes supporting server for theoretical computer science teaching, specifically focusing on reductions between NP-complete problems. Server, except that it contains necessary theory of the topic, allows users to view progress of selected reductions between NP-complete problems and on displayed calculation to better understand principles of working of these algorithms. The text of this work deals with description of essential theories, analysis, design and especially description of implementation of the solution, including technologies used.

Description

Import 03/11/2016

Subject(s)

NP-complete problems, polynomial-time reduction, web application

Citation