Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q3000512)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5897217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of \(k\)-anonymity: hardness and tractability |
scientific article; zbMATH DE number 5897217 |
Statements
Parameterized Complexity of k-Anonymity: Hardness and Tractability (English)
0 references
19 May 2011
0 references
0 references
0.9947787523269652
0 references
0.9162511229515076
0 references
0.9150288701057434
0 references
0.9000953435897827
0 references
0.8767768740653992
0 references
