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

From MaRDI portal
Revision as of 08:10, 14 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q396628)
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
    27 April 2010
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references