The complexity of computing the optimal composition of differential privacy (Q4568112)
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: The complexity of computing the optimal composition of differential privacy |
scientific article; zbMATH DE number 6890207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing the optimal composition of differential privacy |
scientific article; zbMATH DE number 6890207 |
Statements
15 June 2018
0 references
complexity theory
0 references
approximation algorithms
0 references
differential privacy
0 references
composition
0 references
0.9999980330467224
0 references
0.7693216800689697
0 references
0.7593917846679688
0 references
0.758203387260437
0 references
0.7535742521286011
0 references
