Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (Q3557058)

From MaRDI portal
Revision as of 22:01, 12 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    27 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references