Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Dániel Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. pages 735-744, ACM, 2010. [doi]

@inproceedings{Marx10-0,
  title = {Tractable hypergraph properties for constraint satisfaction and conjunctive queries},
  author = {Dániel Marx},
  year = {2010},
  doi = {10.1145/1806689.1806790},
  url = {http://doi.acm.org/10.1145/1806689.1806790},
  tags = {constraints},
  researchr = {https://researchr.org/publication/Marx10-0},
  cites = {0},
  citedby = {0},
  pages = {735-744},
  booktitle = {Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  editor = {Leonard J. Schulman},
  publisher = {ACM},
  isbn = {978-1-4503-0050-6},
}