Computational complexity of auditing finite attributes in statistical databases
type: Item
instance of: scholarly article
title: Computational complexity of auditing finite attributes in statistical databases
zbMATH Open document ID: 1140.68016
author: Peter Jonsson
author: Andrei Krokhin
published in: Journal of Computer and System Sciences
publication date: 2008-06-26T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5293398
zbMATH Keywords: database
zbMATH Keywords: statistical query
zbMATH Keywords: auditing
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.jcss.2008.02.002
OpenAlex ID: W2152976769
cites work: A security machanism for statistical database
cites work: The scaling window of the 2-SAT transition
cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: Q4864250
cites work: Auditing and Inference Control in Statistical Databases
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Frozen development in graph coloring
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: Q4198056
cites work: The complexity of solving equations over finite groups
cites work: Hypertree decompositions and tractable queries
cites work: The Structure of Tractable Constraint Satisfaction Problems
cites work: On the complexity of H-coloring
cites work: Recognizing frozen variables in constraint satisfaction problems
cites work: Auditing Boolean attributes
cites work: Conjunctive-query containment and constraint satisfaction
cites work: Q3365840
cites work: A data distortion by probability distribution
cites work: Q4704799
cites work: Q3208654
cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
cites work: The complexity of satisfiability problems
cites work: Q4488090
DOI: 10.1016/J.JCSS.2008.02.002
description: scientific article; zbMATH DE number 5293398