The complexity of counting \(\mathrm{CSP}^d\)
type: Item
instance of: scholarly article
title: The complexity of counting \(\mathrm{CSP}^d\)
author: Jiabao Lin
published in: Theory of Computing Systems
publication date: 2022-02-14T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7473210
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: counting problems
zbMATH Keywords: holant
zbMATH Keywords: complexity dichotomy
MaRDI profile type: Publication
full work available at URL: s00224-021-10060-x
OpenAlex ID: W3197909928
cites work: A New Holant Dichotomy Inspired by Quantum Computation
cites work: Q5002678
cites work: The complexity of the counting constraint satisfaction problem
cites work: Complexity of Counting CSP with Complex Weights
cites work: Graph homomorphisms with complex values: a dichotomy theorem
cites work: Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
cites work: A complete dichotomy rises from the capture of vanishing signatures
cites work: Clifford gates in the Holant framework
cites work: Holant problems and counting CSP
cites work: Dichotomy for Holant Problems with a Function on Domain Size 3
cites work: The complexity of complex weighted Boolean \#CSP
cites work: Q4608007
cites work: An effective dichotomy for the counting constraint satisfaction problem
cites work: A Complexity Dichotomy for Partition Functions with Mixed Signs
cites work: A dichotomy for real weighted Holant problems
cites work: The Complexity of Boolean Holant Problems with Nonnegative Weights
cites work: Q4899293
cites work: Holographic Algorithms
DOI: 10.1007/S00224-021-10060-X
description: scientific article; zbMATH DE number 7473210