Making the Long Code Shorter (Q3449561)

From MaRDI portal
Revision as of 01:22, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Making the Long Code Shorter
scientific article

    Statements

    title
    Making the Long Code Shorter (English)
    0 references
    DOI
    10.1137/130929394
    0 references
    author
    Boaz Barak
    0 references
    Parikshit Gopalan
    0 references
    Raghu Meka
    0 references
    Prasad Raghavendra
    0 references
    David Steurer
    0 references
    Johan T. Håstad
    0 references
    publication date
    4 November 2015
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C50
    0 references
    94B60
    0 references
    zbMATH DE Number
    6504673
    0 references
    zbMATH Keywords
    hardness of approximation
    0 references
    Cayley graphs
    0 references
    locally testable codes
    0 references
    expanders
    0 references
    Wikidata QID
    Q56958711
    0 references
    OpenAlex ID
    W4233411607
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3449561&oldid=32576150"
    Powered by MediaWiki