On the complexity of \#CSP
type: Item
instance of: scholarly article
zbMATH Open document ID: 1293.68165
DOI: 10.1145/1806689.1806789
author: Martin Dyer
author: David Richerby
published in: Proceedings of the forty-second ACM symposium on Theory of computing
publication date: 2014-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6330114
zbMATH Keywords: complexity dichotomy
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: counting problems
zbMATH Keywords: Mal'tsev polymorphism
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/1806689.1806789
OpenAlex ID: W2058673868
Wikidata QID: Q56323830
DBLP publication ID: conf/stoc/DyerR10
title: On the complexity of \#CSP
description: scientific article; zbMATH DE number 6330114