<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=7764"><dc:title>Set graphs. II. Complexity of set graph recognition and similar problems</dc:title><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Rizzi,	Romeo	(Avtor)
	</dc:creator><dc:creator>Tomescu,	Alexandru I.	(Avtor)
	</dc:creator><dc:subject>acyclic orientation</dc:subject><dc:subject>extensionality</dc:subject><dc:subject>set graphs</dc:subject><dc:subject>NP-complete problem</dc:subject><dc:subject>#P-complete problem</dc:subject><dc:subject>hyper-extensional digraphs</dc:subject><dc:subject>separating code</dc:subject><dc:subject>open-out-separating code</dc:subject><dc:subject/><dc:date>2014</dc:date><dc:date>2016-06-09 03:12:33</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>7764</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>