The minrank of random graphs (Q5002652)

From MaRDI portal
Revision as of 15:35, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7375851
Language Label Description Also known as
English
The minrank of random graphs
scientific article; zbMATH DE number 7375851

    Statements

    author
    Alexander Golovnev
    0 references
    Omri Weinstein
    0 references
    Oded Regev
    0 references
    publication date
    28 July 2021
    0 references
    zbMATH Keywords
    circuit complexity
    0 references
    index coding
    0 references
    information theory
    0 references
    title
    The minrank of random graphs (English)
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C80
    0 references
    05C50
    0 references
    60C05
    0 references
    68Q06
    0 references
    94A29
    0 references
    zbMATH DE Number
    7375851
    0 references
    OpenAlex ID
    W2898680372
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5002652&oldid=39508185"
    Powered by MediaWiki