The complexity of cover graph recognition for some varieties of finite lattices (Q1908932)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of cover graph recognition for some varieties of finite lattices
scientific article

    Statements

    The complexity of cover graph recognition for some varieties of finite lattices (English)
    0 references
    0 references
    0 references
    0 references
    5 May 1996
    0 references
    finite lattice
    0 references
    expander graph
    0 references
    decision problem
    0 references
    cover graph
    0 references
    NP-complete
    0 references

    Identifiers

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