Ključne besede: acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating codeObjavljeno v RUP: 03.04.2017; Ogledov: 2380; Prenosov: 131 Povezava na celotno besedilo