On the public citation graph
A Complexity Dichotomy for Partition Functions with Mixed Signs
0 signed · 115 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1098-2418(200010/12)17:3/4<260::aid-rsa5>3.0.co;2-wopenalex-snapshot
The complexity of counting graph homomorphisms
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_53openalex-snapshot
The Complexity of the Counting Constraint Satisfaction Problem
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_69openalex-snapshot
Complexity of the Cover Polynomial
inferredcites →https://doi.org/10.1016/0095-8956(90)90132-jopenalex-snapshot
On the complexity of H-coloring
inferredcites →https://doi.org/10.1016/j.ejc.2005.04.012openalex-snapshot
The rank of connection matrices and the dimension of graph algebras
inferredcites →https://doi.org/10.1016/j.ejc.2007.11.008openalex-snapshot
Graph parameters and semigroup functions
inferredcites →https://doi.org/10.1016/j.ic.2006.09.005openalex-snapshot
Towards a dichotomy theorem for the counting constraint satisfaction problem
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.011openalex-snapshot
The complexity of partition functions
inferredcites →https://doi.org/10.1016/s0196-8858(03)00087-3openalex-snapshot
On the algebraic complexity of some families of coloured Tutte polynomials
inferredcites →https://doi.org/10.1017/s0305004100068936openalex-snapshot
On the computational complexity of the Jones and Tutte polynomials
inferredcites →https://doi.org/10.1090/s0894-0347-06-00529-7openalex-snapshot
Reflection positivity, rank connectivity, and homomorphism of graphs
inferredcites →https://doi.org/10.1145/1120582.1120584openalex-snapshot
A dichotomy theorem for constraint satisfaction problems on a 3-element set
inferredcites →https://doi.org/10.1145/1250790.1250858openalex-snapshot
Inapproximability of the Tutte polynomial
inferredcites →https://doi.org/10.1145/1314690.1314691openalex-snapshot
On counting homomorphisms to directed acyclic graphs
inferredcites →https://doi.org/10.1145/1374376.1374488openalex-snapshot
Graphs, polymorphisms and the complexity of homomorphism problems
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/509907.509917openalex-snapshot
The complexity of choosing an H -colouring (nearly) uniformly at random
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_747openalex-snapshot
Complexity Dichotomies for Counting Graph Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_28openalex-snapshot
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_25openalex-snapshot
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_30openalex-snapshot
A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_24openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_16openalex-snapshot
On Tractable Exponential Sums
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_24openalex-snapshot
From Holant to #CSP and Back: Dichotomy for Holant c Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_60openalex-snapshot
The Complexity of Symmetric Boolean Parity Holant Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_13openalex-snapshot
Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_747-1openalex-snapshot
Complexity Dichotomies for Counting Graph Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_30openalex-snapshot
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_1openalex-snapshot
Complexity Dichotomy for Counting Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_44openalex-snapshot
The Complexity of Planar Boolean #CSP with Complex Weights
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_23openalex-snapshot
Holographic Algorithms Beyond Matchgates
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_52openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.1007/978-981-15-5747-7_1openalex-snapshot
A New Graph Polynomial and Generalized Tutte–Grothendieck Invariant from Quantum Circuits
inferred← citeshttps://doi.org/10.1007/s00037-015-0118-3openalex-snapshot
A Dichotomy for Real Weighted Holant Problems
inferred← citeshttps://doi.org/10.1007/s00037-019-00184-5openalex-snapshot
A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
inferred← citeshttps://doi.org/10.1007/s00220-014-2036-7openalex-snapshot
Lee–Yang Theorems and the Complexity of Computing Averages
inferred← citeshttps://doi.org/10.1007/s00220-022-04320-1openalex-snapshot
Classical Simulation of Quantum Circuits by Half Gauss Sums
inferred← citeshttps://doi.org/10.1007/s00224-013-9518-4openalex-snapshot
Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/s00224-016-9671-7openalex-snapshot
Holant Problems for 3-Regular Graphs with Complex Edge Functions
inferred← citeshttps://doi.org/10.1007/s00224-020-09983-8openalex-snapshot
Dichotomy for Holant∗ Problems on the Boolean Domain
inferred← citeshttps://doi.org/10.1007/s00224-021-10060-xopenalex-snapshot
The Complexity of Counting CSPd
inferred← citeshttps://doi.org/10.1007/s00453-012-9626-6openalex-snapshot
From Holant to #CSP and Back: Dichotomy for Holant c Problems
inferred← citeshttps://doi.org/10.1007/s00493-016-3338-5openalex-snapshot
The parameterised complexity of counting even and odd induced subgraphs
inferred← citeshttps://doi.org/10.1007/s10955-018-2199-2openalex-snapshot
The Ising Partition Function: Zeros and Deterministic Approximation
inferred← citeshttps://doi.org/10.1007/s10955-021-02831-0openalex-snapshot
Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.002openalex-snapshot
A collapse theorem for holographic algorithms with matchgates on domain size at most 4
inferred← citeshttps://doi.org/10.1016/j.ic.2018.01.002openalex-snapshot
Holographic algorithms beyond matchgates
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105064openalex-snapshot
Complexity classification of the eight-vertex model
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105340openalex-snapshot
Two-state spin systems with negative interactions
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105421openalex-snapshot
Dichotomy for Holant* problems with one ternary function on domain size 3
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.12.002openalex-snapshot
The complexity of weighted and unweighted #CSP
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.07.003openalex-snapshot
The complexity of complex weighted Boolean #CSP
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.07.005openalex-snapshot
The complexity of planar Boolean #CSP with complex weights
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.09.002openalex-snapshot
A dichotomy for bounded degree graph homomorphisms with nonnegative weights
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.021openalex-snapshot
Spin systems on k -regular graphs with complex edge functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.043openalex-snapshot
Partition functions on k -regular graphs with { 0 , 1 } -vertex assignments and real edge functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114835openalex-snapshot
A complexity trichotomy for k-regular asymmetric spin systems with complex edge functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114940openalex-snapshot
The complexity of ferromagnetic 2-spin systems on bounded degree graphs
inferred← citeshttps://doi.org/10.1017/9781107477063openalex-snapshot
Complexity Dichotomies for Counting Problems
inferred← citeshttps://doi.org/10.1017/s0963548312000259openalex-snapshot
Complexity of Ising Polynomials
inferred← citeshttps://doi.org/10.1017/s0963548321000286openalex-snapshot
Perfect matchings, rank of connection tensors and graph homomorphisms
inferred← citeshttps://doi.org/10.1090/conm/558/11053openalex-snapshot
Counting homomorphisms and partition functions
inferred← citeshttps://doi.org/10.1109/ccc.2011.32openalex-snapshot
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.1109/ccc.2012.16openalex-snapshot
A Dichotomy for Real Weighted Holant Problems
inferred← citeshttps://doi.org/10.1109/focs.2008.34openalex-snapshot
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness
inferred← citeshttps://doi.org/10.1109/focs.2014.70openalex-snapshot
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems
inferred← citeshttps://doi.org/10.1109/focs.2017.95openalex-snapshot
The Ising Partition Function: Zeros and Deterministic Approximation
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00105openalex-snapshot
A Dichotomy for Real Boolean Holant Problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00106openalex-snapshot
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1109/synasc.2012.36openalex-snapshot
A Computational Framework for the Study of Partition Functions and Graph Polynomials
inferred← citeshttps://doi.org/10.1137/1.9781611973099.74openalex-snapshot
Approximate Counting via Correlation Decay in Spin Systems
inferred← citeshttps://doi.org/10.1137/1.9781611973105.93openalex-snapshot
Dichotomy for Holant Problems with a Function on Domain Size 3
inferred← citeshttps://doi.org/10.1137/1.9781611975482.30openalex-snapshot
Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms
inferred← citeshttps://doi.org/10.1137/100814585openalex-snapshot
Computational Complexity of Holant Problems
inferred← citeshttps://doi.org/10.1137/100815530openalex-snapshot
The Complexity of Symmetric Boolean Parity Holant Problems
inferred← citeshttps://doi.org/10.1137/110840194openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.1137/15m1032314openalex-snapshot
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.1137/15m1049798openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
inferred← citeshttps://doi.org/10.1137/17m113304xopenalex-snapshot
The Complexity of Boolean Holant Problems with Nonnegative Weights
inferred← citeshttps://doi.org/10.1142/9789814449274_0012openalex-snapshot
A Computational Framework for the Study of Partition Functions and Graph Polynomials
inferred← citeshttps://doi.org/10.1145/2090236.2090272openalex-snapshot
Gadgets and anti-gadgets leading to a complexity dichotomy
inferred← citeshttps://doi.org/10.1145/2213977.2214059openalex-snapshot
Complexity of counting CSP with complex weights
inferred← citeshttps://doi.org/10.1145/2488608.2488686openalex-snapshot
Lee-Yang theorems and the complexity of computing averages
inferred← citeshttps://doi.org/10.1145/2488608.2488687openalex-snapshot
A complete dichotomy rises from the capture of vanishing signatures
inferred← citeshttps://doi.org/10.1145/2635825openalex-snapshot
The complexity of counting homomorphisms to cactus graphs modulo 2
inferred← citeshttps://doi.org/10.1145/2822891openalex-snapshot
Complexity of Counting CSP with Complex Weights
inferred← citeshttps://doi.org/10.1145/2898441openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.1145/3305272openalex-snapshot
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
inferred← citeshttps://doi.org/10.1145/3381425openalex-snapshot
Holant Clones and the Approximability of Conservative Holant Problems
inferred← citeshttps://doi.org/10.1145/3448641openalex-snapshot
On a Theorem of Lovász that (&sdot, H ) Determines the Isomorphism Type of H
inferred← citeshttps://doi.org/10.1145/3460958openalex-snapshot
Counting Homomorphisms to Trees Modulo a Prime
inferred← citeshttps://doi.org/10.1145/3564246.3585173openalex-snapshot
The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3
inferred← citeshttps://doi.org/10.1145/3749740.3749756openalex-snapshot
Valiant’s Contributions to Counting Complexity
inferred← citeshttps://doi.org/10.1186/s40687-016-0067-8openalex-snapshot
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
inferred← citeshttps://doi.org/10.22331/q-2019-07-11-162openalex-snapshot
Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.22openalex-snapshot
From Holant to Quantum Entanglement and Back
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.91openalex-snapshot
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.17openalex-snapshot
On a Theorem of Lovász that $\hom(\cdot, H)$ Determines the Isomorphism Type of $H$
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.40openalex-snapshot
A Dichotomy for Real Boolean Holant Problems
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.59openalex-snapshot
Counting Homomorphisms Modulo a Prime Number
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0464openalex-snapshot
Holant Problems for Regular Graphs with Complex Edge Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5659openalex-snapshot
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.48550/arxiv.1108.3383openalex-snapshot
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6445openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
inferred← citeshttps://doi.org/10.48550/arxiv.1211.2376openalex-snapshot
Lee-Yang theorems and the complexity of computing averages
inferred← citeshttps://doi.org/10.48550/arxiv.1212.2284openalex-snapshot
The Complexity of Planar Boolean #CSP with Complex Weights
inferred← citeshttps://doi.org/10.48550/arxiv.1307.7430openalex-snapshot
Holographic Algorithms Beyond Matchgates
inferred← citeshttps://doi.org/10.48550/arxiv.1309.4033openalex-snapshot
The complexity of parity graph homomorphism: an initial investigation
inferred← citeshttps://doi.org/10.48550/arxiv.1404.4020openalex-snapshot
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3375openalex-snapshot
The parameterised complexity of counting even and odd induced subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1412.0423openalex-snapshot
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1501.07539openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.48550/arxiv.1504.04044openalex-snapshot
FAQ: Questions Asked Frequently
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.