\(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690)
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: k-attribute-anonymity is hard even for k=2 |
scientific article; zbMATH DE number 6378687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k\)-attribute-anonymity is hard even for \(k=2\) |
scientific article; zbMATH DE number 6378687 |
Statements
\(k\)-attribute-anonymity is hard even for \(k=2\) (English)
0 references
9 December 2014
0 references
computational complexity
0 references
database privacy
0 references
data anonymization
0 references
fixed parameter tractability
0 references
NP-hardness
0 references
0 references
0.8569557070732117
0 references
0.8548656702041626
0 references
0.8483763337135315
0 references
0.8481194376945496
0 references
0.8409003615379333
0 references
