Pages that link to "Item:Q3000512"

The following pages link to Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512):

Displaying 3 items.

• The \(l\)-diversity problem: tractability and approximability (Q392037) (← 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)