1. |
2. |
3. |
4. Set graphs. II. Complexity of set graph recognition and similar problemsMartin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2014, izvirni znanstveni članek Ključne besede: acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code Objavljeno v RUP: 03.04.2017; Ogledov: 2331; Prenosov: 131 Povezava na celotno besedilo |
5. |
6. |
7. On hereditary efficiently dominatable graphsMartin Milanič, 2011, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: popolna koda, učinkovita dominacija, grafi z učinkovito dominantno množico, polinomski algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes Objavljeno v RUP: 15.10.2015; Ogledov: 3452; Prenosov: 245 Povezava na celotno besedilo |
8. |
9. |
10. Coding theory and applications, solved exercises and problems of linear codesEnes Pašalić, 2013, drugo učno gradivo Ključne besede: Gilbert-Eliot channel model, linear code, linear block code, code design, undetected error probability, linear independence, standard form, codeword weight, code rate, systematic code, Binary Hamming code Objavljeno v RUP: 15.10.2013; Ogledov: 5396; Prenosov: 95 Povezava na celotno besedilo |