Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Three‐query PCPs with perfect completeness over non‐Boolean domains |
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
29 August 2005
0 references
0.84262097
0 references
0.8302201
0 references
0.82943064
0 references
0.8251208
0 references
0.8242763
0 references
0.82414824
0 references
0.82252264
0 references
