The k-Anonymity Problem Is Hard

DOI10.1007/978-3-642-03409-1_4zbMath1252.68107OpenAlexW1552319389MaRDI QIDQ3183594

Gianluca Della Vedova, Riccardo Dondi, Paola Bonizzoni

Publication date: 20 October 2009

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_4

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Parameterized Complexity of k-Anonymity: Hardness and Tractability

This page was built for publication: The k-Anonymity Problem Is Hard