@InProceedings{lin:LIPIcs.ITCS.2021.40,
  author =	{Lin, Jiabao},
  title =	{{On the Complexity of #CSP^d}},
  booktitle =	{12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
  pages =	{40:1--40:10},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-177-1},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{185},
  editor =	{Lee, James R.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.40},
  URN =		{urn:nbn:de:0030-drops-135793},
  doi =		{10.4230/LIPIcs.ITCS.2021.40},
  annote =	{Keywords: Constraint satisfaction problem, counting problems, Holant, complexity dichotomy}
}