Computational Complexity of Itemset Frequency Satisfiability

Toon Calders. Computational Complexity of Itemset Frequency Satisfiability. In Alin Deutsch, editor, Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France. pages 143-154, ACM, 2004. [doi]

@inproceedings{Calders04:0,
  title = {Computational Complexity of Itemset Frequency Satisfiability},
  author = {Toon Calders},
  year = {2004},
  doi = {10.1145/1055558.1055580},
  url = {http://doi.acm.org/10.1145/1055558.1055580},
  researchr = {https://researchr.org/publication/Calders04%3A0},
  cites = {0},
  citedby = {0},
  pages = {143-154},
  booktitle = {Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France},
  editor = {Alin Deutsch},
  publisher = {ACM},
  isbn = {1-58113-858-X},
}