Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6320770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Set graphs. II. Complexity of set graph recognition and similar problems |
scientific article; zbMATH DE number 6320770 |
Statements
Set graphs. II. Complexity of set graph recognition and similar problems (English)
0 references
25 July 2014
0 references
acyclic orientation
0 references
extensionality
0 references
set graph
0 references
NP-complete problem
0 references
\#P-complete problem
0 references
hyper-extensional digraph
0 references
separating code
0 references
open-out-separating code
0 references
0 references
0 references
0 references
0 references
0.8748061060905457
0 references
0.8101014494895935
0 references
0.739200234413147
0 references
0.7256500720977783
0 references
0.7118828892707825
0 references
