Pcps and the hardness of generating private synthetic data (Q3000552)
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: Pcps and the hardness of generating private synthetic data |
scientific article; zbMATH DE number 5897269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pcps and the hardness of generating private synthetic data |
scientific article; zbMATH DE number 5897269 |
Statements
PCPs and the Hardness of Generating Private Synthetic Data (English)
0 references
19 May 2011
0 references
privacy
0 references
digital signatures
0 references
inapproximability
0 references
constraint satisfaction problems
0 references
probabilistically checkable proofs
0 references
0.9809339046478271
0 references
0.7851613163948059
0 references
0.7769119143486023
0 references
0.7689144611358643
0 references
0.7646001577377319
0 references
