Auditing Boolean attributes
From MaRDI portal
Publication:1394802
DOI10.1016/S0022-0000(02)00036-3zbMath1026.68042DBLPjournals/jcss/KleinbergPR03OpenAlexW2630394794WikidataQ57904538 ScholiaQ57904538MaRDI QIDQ1394802
Prabhakar Raghavan, Christos H. Papadimitriou, Jon M. Kleinberg
Publication date: 25 June 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(02)00036-3
Related Items (7)
Denials leak information: simulatable auditing ⋮ Some results of Christos Papadimitriou on internet structure, network routing, and web information ⋮ Computational complexity of auditing finite attributes in statistical databases ⋮ An analytical approach to the inference of summary data of additive type ⋮ Recognizing frozen variables in constraint satisfaction problems ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? ⋮ Cardinality-Based Inference Control in Sum-Only Data Cubes
Cites Work
This page was built for publication: Auditing Boolean attributes