Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: AEtnaNova / rank | |||
Normal rank | |||
Revision as of 17:47, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Set graphs. II. Complexity of set graph recognition and similar problems |
scientific article |
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
