Keywords: acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating codePublished in RUP: 03.04.2017; Views: 2380; Downloads: 131 Link to full text