Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912)

From MaRDI portal
Revision as of 11:27, 22 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2200114
Language Label Description Also known as
English
Three‐query PCPs with perfect completeness over non‐Boolean domains
scientific article; zbMATH DE number 2200114

    Statements

    Three‐query PCPs with perfect completeness over non‐Boolean domains (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2005
    0 references
    0 references