Resolving the Complexity of Some Data Privacy Problems
From MaRDI portal
Publication:3587455
DOI10.1007/978-3-642-14162-1_33zbMath1288.68058arXiv1004.3811OpenAlexW1880832693MaRDI QIDQ3587455
Jeremiah Blocki, R. Ryan Williams
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.3811
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Parameterized complexity of \(k\)-anonymity: hardness and tractability ⋮ The \(l\)-diversity problem: tractability and approximability ⋮ The effect of homogeneity on the computational complexity of combinatorial data anonymization ⋮ \(k\)-attribute-anonymity is hard even for \(k=2\) ⋮ Parameterized Complexity of k-Anonymity: Hardness and Tractability ⋮ Pattern-guided \(k\)-anonymity ⋮ Clustering with lower-bounded sizes. A general graph-theoretic framework ⋮ The Effect of Homogeneity on the Complexity of k-Anonymity ⋮ Using patterns to form homogeneous teams
This page was built for publication: Resolving the Complexity of Some Data Privacy Problems
