Pages that link to "Item:Q3000512"
From MaRDI portal
The following pages link to Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512):
Displaying 4 items.
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- Hardness of \(k\)-anonymous microaggregation (Q1983125) (← links)
- The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
- The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)