NP-Completeness in the gossip monoid (Q4576008)

From MaRDI portal
Revision as of 08:40, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6902206
Language Label Description Also known as
English
NP-Completeness in the gossip monoid
scientific article; zbMATH DE number 6902206

    Statements

    title
    NP-Completeness in the gossip monoid (English)
    0 references
    author
    Peter Fenner
    0 references
    Marianne Johnson
    0 references
    Mark Kambites
    0 references
    publication date
    12 July 2018
    0 references
    zbMATH Keywords
    gossip
    0 references
    semigroup theory
    0 references
    computational complexity
    0 references
    networks
    0 references

    Identifiers

    zbMATH DE Number
    6902206
    0 references
    arXiv ID
    1606.01026
    0 references
    OpenAlex ID
    W2963266480
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4576008&oldid=36925443"
    Powered by MediaWiki