Results
2 results
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. A model theoretic perspective on matrix rings Igor Klep, Marcus Tressl, 2025, original scientific article Keywords: model theory, quantifier elimination, matrix rings, trace, decidability, free analysis, simultaneous conjugacy problem |
Search done in 0.01 sec.
Back to top