1 - 3 / 3 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. Research on the traction and obstacle surmounting performance of an adaptive pipeline plugging robot Hongwei Yan, Jian Li, Ziming Kou, Yi Liu, Pengcheng Li, Lu Wang, 2022, izvirni znanstveni članek Ključne besede: pipeline leakage, plugging robots, obstacle crossing, optimum driving angle, simulation analysis |
3. Domination and independence numbers of large 2-crossing-critical graphs Vesna Iršič, Maruša Lekše, Miha Pačnik, Petra Podlogar, Martin Praček, 2023, izvirni znanstveni članek Ključne besede: crossing-critical graphs, domination number, independence number |