Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (Q3557058): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:41, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs |
scientific article |
Statements
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (English)
0 references
27 April 2010
0 references
