2 rezultata
1 - 2 / 2   1  |
1. Verifying time complexity of Turing machines David Gajser, 2015, doktorska disertacija Ključne besede: Turing machine, relativization, NP-completeness, crossing sequence, decidability, lower bound, time complexity, running time, linear time |
2. The k-Partition Problem Emil Batakliev, 2023, magistrsko delo Ključne besede: array, algorithm, time complexity, space complexity |
Iskanje izvedeno v 0.01 sek.
Na vrh