Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (Q3557058): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q396628 |
Changed an Item |
||
Property / author | |||
Property / author: Marek Karpinski / rank | |||
Normal rank |
Revision as of 09:10, 14 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