A dichotomy for real weighted Holant problems
type: Item
instance of: scholarly article
title: A dichotomy for real weighted Holant problems
zbMATH Open document ID: 1336.68099
author: Sangxia Huang
author: Pinyan Lu
published in: Computational Complexity
publication date: 2016-03-21T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6558798
MaRDI profile type: Publication
full work available at URL: s00037-015-0118-3
OpenAlex ID: W2244287056
cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
cites work: Q4398864
cites work: From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
cites work: Q4536432
cites work: The complexity of weighted Boolean \#CSP with mixed signs
cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set
cites work: The complexity of the counting constraint satisfaction problem
cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem
cites work: Automata, Languages and Programming
cites work: The complexity of partition functions
cites work: Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
cites work: Graph homomorphisms with complex values: a dichotomy theorem
cites work: A complete dichotomy rises from the capture of vanishing signatures
cites work: A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
cites work: Holographic algorithms by Fibonacci gates
cites work: Holant problems and counting CSP
cites work: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
cites work: A computational proof of complexity of some restricted counting problems
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Tensor Geometry
cites work: The Complexity of Weighted Boolean #CSP
cites work: On counting homomorphisms to directed acyclic graphs
cites work: Q4952624
cites work: Corrigendum: The complexity of counting graph homomorphisms
cites work: On the complexity of \#CSP
cites work: Q3113690
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: The complexity of counting Eulerian tours in 4-regular graphs
cites work: A Complexity Dichotomy for Partition Functions with Mixed Signs
cites work: Q3113689
cites work: The complexity of symmetric Boolean parity Holant problems
cites work: On the complexity of H-coloring
cites work: Beitrag zur Theorie des Ferromagnetismus
cites work: On the computational complexity of the Jones and Tutte polynomials
cites work: Q4002474
cites work: Holant Problems for Regular Graphs with Complex Edge Functions
cites work: On the Structure of Polynomial Time Reducibility
cites work: On the evaluation at (3,3) of the Tutte polynomial of a graph
cites work: Integer Programming with a Fixed Number of Variables
cites work: On the number of Eulerian orientations of a graph
cites work: Q4743737
cites work: The complexity of computing the permanent
cites work: Holographic Algorithms
cites work: Some Observations on Holographic Algorithms
cites work: The Computational Complexity of Tutte Invariants for Planar Graphs
DOI: 10.1007/S00037-015-0118-3
description: scientific article; zbMATH DE number 6558798