<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-FCUAES0E</identifier><date>2004</date><creator>Petr, Ciril</creator><relation>documents/visokosolska_dela/visokosolska_dela/html/urn_nbn_si_doc-fcuaes0e.html</relation><relation>documents/visokosolska_dela/visokosolska_dela/pdf/urn_nbn_si_doc-fcuaes0e.pdf</relation><relation>documents/visokosolska_dela/visokosolska_dela/txt/urn_nbn_si_doc-fcuaes0e.txt</relation><relation>https://dk.um.si/IzpisGradiva.php?id=52098</relation><format format_type="main">112 strani</format><format format_type="type">doktorska dela</format><format format_type="extent">IX, 102 str., 30 cm</format><identifier identifier_type="COBISSID">13020761</identifier><identifier>f2\n603718</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-FCUAES0E</identifier><language>slv</language><publisher>C. Petr</publisher><source>visokošolska dela</source><rights>InC</rights><subject language_type_id="slv">1-popolna koda</subject><subject language_type_id="slv">algoritmi</subject><subject language_type_id="eng">computer science</subject><subject language_type_id="slv">Disertacije</subject><subject language_type_id="slv">grafi Sierpińskega</subject><subject language_type_id="slv">Hanojski stolpi</subject><subject language_type_id="slv">Kombinatorika</subject><subject language_type_id="slv">najkrajša pot</subject><subject language_type_id="slv">računalništvo</subject><title>doktorska disertacija</title><title>Kombinatorika posplošenih Hanojskih stolpov</title></Record>