@InProceedings{jonsson_et_al:LIPIcs.MFCS.2018.43,
  author =	{Jonsson, Peter and Lagerkvist, Victor},
  title =	{{Why are CSPs Based on Partition Schemes Computationally Hard?}},
  booktitle =	{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
  pages =	{43:1--43:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-086-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{117},
  editor =	{Potapov, Igor and Spirakis, Paul and Worrell, James},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.43},
  URN =		{urn:nbn:de:0030-drops-96257},
  doi =		{10.4230/LIPIcs.MFCS.2018.43},
  annote =	{Keywords: Constraint satisfaction problems, infinite domains, partition schemes, lower bounds}
}