Computational complexity of the Hamiltonian cycle problem in dense hypergraphs (Q3557058)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of the Hamiltonian cycle problem in dense hypergraphs |
scientific article; zbMATH DE number 5702190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the Hamiltonian cycle problem in dense hypergraphs |
scientific article; zbMATH DE number 5702190 |
Statements
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (English)
0 references
27 April 2010
0 references
0.8481476306915283
0 references
0.8157959580421448
0 references
0.8125664591789246
0 references
0.8060389161109924
0 references
