Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 23:20, 8 February 2024

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