Dichotomy result on 3-regular bipartite non-negative functions
type: Item
instance of: scholarly article
title: Dichotomy result on 3-regular bipartite non-negative functions
author: Austen Z. Fan
author: Jin-Yi Cai
published in: Theoretical Computer Science
publication date: 2023-02-24T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7657065
zbMATH Keywords: Holant problem
zbMATH Keywords: dichotomy theorem
zbMATH Keywords: bipartite graph
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2023.113745
OpenAlex ID: W4319025314
cites work: Dichotomy result on 3-regular bipartite non-negative functions
cites work: Holographic Algorithms
cites work: The complexity of the counting constraint satisfaction problem
cites work: An effective dichotomy for the counting constraint satisfaction problem
cites work: Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
cites work: Complexity of Counting CSP with Complex Weights
cites work: Reflection positivity, rank connectivity, and homomorphism of graphs
cites work: Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms
cites work: Q5002678
cites work: Holant Clones and the Approximability of Conservative Holant Problems
cites work: Complexity Dichotomies for Counting Problems
cites work: A complete dichotomy rises from the capture of vanishing signatures
cites work: The Complexity of Boolean Holant Problems with Nonnegative Weights
cites work: Holant problems for 3-regular graphs with complex edge functions
cites work: The complexity of counting in sparse, regular, and planar graphs
cites work: Clustering to minimize the maximum intercluster distance
DOI: 10.1016/J.TCS.2023.113745
Recommended article: Holant problems for 3-regular graphs with complex edge functions
Recommended article: Holant Problems for Regular Graphs with Complex Edge Functions
Recommended article: Q5111359
Recommended article: A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
Recommended article: Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions
description: scientific article; zbMATH DE number 7657065