1 - 2 / 2 1 |
1. Verifying time complexity of Turing machines David Gajser, 2015, doctoral dissertation Keywords: Turing machine, relativization, NP-completeness, crossing sequence, decidability, lower bound, time complexity, running time, linear time |
2. The k-Partition Problem Emil Batakliev, 2023, master's thesis Keywords: array, algorithm, time complexity, space complexity |