Pages that link to "Item:Q543515"
From MaRDI portal
The following pages link to Anonymizing binary and small tables is hard to approximate (Q543515):
Displaying 10 items.
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
- Achieving anonymity via clustering (Q2930330) (← links)
- The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)
- Database Theory - ICDT 2005 (Q5316598) (← links)