Komponenta výukového serveru TI - P-úplné problémy

Abstract

This bachelor’s thesis focuses on the development of a teaching-oriented web application for illustrating P-complete problems. The main goal is to facilitate students’ understanding and practice of such tasks. The application focuses on the Monotone Circuit Value Problem (MCVP), Context-Free Grammar Non-emptiness Problem, and Combinatorial Games on Graphs. The project implements modules for interactive input of problem instances (manually, via random generation, or by selecting from a pre-defined set) and provides a simulation of their solutions. Users can also observe a step-bystep reduction from an MCVP instance to the other mentioned problems and subsequently explore how those are solved. The resulting application demonstrates key concepts of theoretical computer science, including the notion of P-completeness, and provides a flexible basis for educational use