Anonymizing binary and small tables is hard to approximate (Q543515)
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: Anonymizing binary and small tables is hard to approximate |
scientific article; zbMATH DE number 5909299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Anonymizing binary and small tables is hard to approximate |
scientific article; zbMATH DE number 5909299 |
Statements
Anonymizing binary and small tables is hard to approximate (English)
0 references
17 June 2011
0 references
\(k\)-anonymity
0 references
APX-hardness
0 references
computational complexity
0 references
clustering
0 references
