Course projects on various NP and NPH problems on CTU in Prague 2021. Knapsack problem with various approaches, analysis of effectivity and robustness. Instances generation and validation.

This project implements a graph coloring algorithm to demonstrate the NP-Completeness of the COL problem. The algorithm is designed to solve the problem in polynomial time, efficiently coloring the ...