1 - 2 / 2 ![]() ![]() ![]() ![]() |
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. Connectivity with uncertainty regions given as line segments Sergio Cabello, David Gajser, 2024, izvirni znanstveni članek Ključne besede: computational geometry, uncertainty, geometric optimization, fixed parameter tractability, parametric search |