Combinatorial families that are exponentially far from being listable in Gray code sequence (Q4216327)

From MaRDI portal
Revision as of 09:25, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1214880
Language Label Description Also known as
English
Combinatorial families that are exponentially far from being listable in Gray code sequence
scientific article; zbMATH DE number 1214880

    Statements

    Combinatorial families that are exponentially far from being listable in Gray code sequence (English)
    0 references
    0 references
    0 references
    0 references
    26 October 1998
    0 references
    Gray code
    0 references
    nonexistence
    0 references
    existence problem
    0 references
    Hamiltonian path problem
    0 references
    NP-complete
    0 references

    Identifiers

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