Short PCPs with Polylog Query Complexity (Q3624377)

From MaRDI portal
Revision as of 04:55, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Short PCPs with Polylog Query Complexity
scientific article

    Statements

    title
    Short PCPs with Polylog Query Complexity (English)
    0 references
    author
    Eli Ben-Sasson
    0 references
    Madhu Sudan
    0 references
    publication date
    30 April 2009
    0 references
    zbMATH Keywords
    probabilistically checkable proofs
    0 references
    PCPs of proximity
    0 references
    locally testable codes
    0 references
    Reed-Solomon codes
    0 references

    Identifiers

    DOI
    10.1137/050646445
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    68P30
    0 references
    94B60
    0 references
    zbMATH DE Number
    5549688
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3624377&oldid=17057616"
    Powered by MediaWiki