Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 2
Magistrsko delo
Oznake: array;algorithm;time complexity;space complexity;computer science;master's thesis;
In this thesis we will analyze the k-Partition Problem. Specifically, we will analyze the five best algorithms for solving the Partition Problem, after which we will analyze five new algorithms for solving the k-Partition Problem. Two of these algorithms will be my contribution towards both problems ...
Leto: 2023 Vir: Fakulteta za računalništvo in informatiko (UL FRI)
Diplomsko delo
Oznake: subarray;algorithm;complexity;computer and information science;diploma;
In this thesis we will focus on different algorithms for solving the Partition Problem. First, we will explain what the Partition Problem is and why it has been causing so many difficulties even in its simplest form. Then we will focus on different methods and algorithms for solving this problem tha ...
Leto: 2020 Vir: Fakulteta za računalništvo in informatiko (UL FRI)
Št. zadetkov: 2
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: