Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.20050 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1549730417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hardness results for approximate hypergraph coloring / rank | |||
Normal rank | |||
Latest revision as of 15:46, 10 June 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
29 August 2005
0 references
