1 - 1 / 1 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 |