Computational complexity of auditing finite attributes in statistical databases (Q931731): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andrei A. Krokhin / rank
Normal rank
 
Property / author
 
Property / author: Andrei A. Krokhin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2008.02.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152976769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A security machanism for statistical database / rank
 
Normal rank
Property / cites work
 
Property / cites work: The scaling window of the 2-SAT transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Auditing and Inference Control in Statistical Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frozen development in graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of solving equations over finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Tractable Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing frozen variables in constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Auditing Boolean attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data distortion by probability distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488090 / rank
 
Normal rank

Latest revision as of 12:45, 28 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of auditing finite attributes in statistical databases
scientific article

    Statements

    Computational complexity of auditing finite attributes in statistical databases (English)
    0 references
    0 references
    0 references
    26 June 2008
    0 references
    0 references
    database
    0 references
    statistical query
    0 references
    auditing
    0 references
    constraint satisfaction problem
    0 references
    computational complexity
    0 references
    0 references