1. Optimizacija in grafi : učinkovitost nekaterih algoritmov v teoriji in praksiMarko Grgurovič, 2025, doktorska disertacija Ključne besede: dynamic programming, combinatorial optimization, ant colony optimization, shortest path problem, bottleneck path problem, traveling salesman problem, parallel algorithms, asymptotic analysis, expected-case analysis
Objavljeno v RUP: 17.12.2025; Ogledov: 270; Prenosov: 6
 Celotno besedilo (927,66 KB)
Gradivo ima več datotek! Več... |
2. |
3. Passing from plat closure to standard closure of braids in R^3, in handlebodies and in thickened surfacesPaolo Cavicchioli, Sofia Lambropoulou, 2025, izvirni znanstveni članek Opis: Given a knot or link in the form of plat closure of a braid, we describe an algorithm to obtain a braid representing the same knot or link with the standard closure, and vice-versa. We analyze the three cases of knots and links in ℝ^3, in handlebodies and in thickened surfaces, and we give for each one a detailed construction of the relative algorithm, with proofs of the results and the calculation of the computational complexity. Indeed, we show that the algorithm has quadratic computational complexity in the number of crossings and loop generators of the braid when passing from plat to standard closure, while it has linear computational complexity in the number of crossings generators of the braid when passing from standard to plat closure. The article includes numerous illustrations to facilitate the understanding of the results, as well as an example of implementation of the algorithm for the general case.
Ključne besede: standard closure of braids, plat closure of braids, classical knots and links, knots and links in the handlebody, knots and links in thickened surfaces, algorithms and complexity
Objavljeno v RUP: 03.11.2025; Ogledov: 337; Prenosov: 2
Celotno besedilo (1,82 MB) |
4. |
5. |
6. On applications of quantum algorithms in cryptanalysis of block ciphers : master's thesisDraženka Višnjić, 2021, magistrsko delo Ključne besede: quantum algorithms, cryptanalysis of block ciphers, postquantum analysis, Simon's algorithm, Grover's algorithm, Bernstein-Vazirani's algorithm, Kuperberg's algorithm, Feistel network, SPN, FX
Objavljeno v RUP: 18.10.2021; Ogledov: 3228; Prenosov: 48
 Povezava na celotno besedilo |
7. |
8. Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing unitsChristian Trefftz, Andrés Santamaría-Galvis, Roberto Cruz Rodes, 2014, objavljeni znanstveni prispevek na konferenci Ključne besede: graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal clique
Objavljeno v RUP: 18.10.2021; Ogledov: 2631; Prenosov: 26
Povezava na celotno besedilo |
9. |
10. |
