Set graphs. II. Complexity of set graph recognition and similar problems
2014
2016-06-09 03:12:33
1033
acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code,
r6
Martin
Milanič
70
Romeo
Rizzi
70
Alexandru I.
Tomescu
70
ISSN
2
0304-3975
UDK
4
519.17
OceCobissID
13
26525952
DOI
15
10.1016/j.tcs.2014.06.017
COBISS.SI-ID
3
1537143492
0
Predstavitvena datoteka
2016-06-09 03:12:33