Short PCPs with Polylog Query Complexity (Q3624377)

From MaRDI portal
Revision as of 18:50, 16 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Short PCPs with Polylog Query Complexity
scientific article

    Statements

    Short PCPs with Polylog Query Complexity (English)
    0 references
    0 references
    0 references
    30 April 2009
    0 references
    probabilistically checkable proofs
    0 references
    PCPs of proximity
    0 references
    locally testable codes
    0 references
    Reed-Solomon codes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references