On the public citation graph
Complexity of Counting CSP with Complex Weights
0 signed · 71 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.1006/inco.1996.0016openalex-snapshot
Complexity of Generalized Satisfiability Counting Problems
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-642-14553-7_16openalex-snapshot
On Tractable Exponential Sums
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.cosrev.2008.10.003openalex-snapshot
Colouring, constraint satisfaction, and complexity
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.jcss.2011.12.002openalex-snapshot
The complexity of weighted and unweighted #CSP
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.011openalex-snapshot
The complexity of partition functions
inferredcites →https://doi.org/10.1090/s0273-0979-1992-00284-7openalex-snapshot
Algorithms in algebraic number theory
inferredcites →https://doi.org/10.1109/focs.2010.49openalex-snapshot
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights
inferredcites →https://doi.org/10.1137/050628957openalex-snapshot
A Simple Algorithm for Mal'tsev Constraints
inferredcites →https://doi.org/10.1137/070708093openalex-snapshot
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
inferredcites →https://doi.org/10.1137/090757496openalex-snapshot
A Complexity Dichotomy for Partition Functions with Mixed Signs
inferredcites →https://doi.org/10.1137/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1137/100811258openalex-snapshot
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
inferredcites →https://doi.org/10.1137/110840194openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferredcites →https://doi.org/10.1137/15m1032314openalex-snapshot
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1142/9789814415255_0002openalex-snapshot
Exactly Solved Models in Statistical Mechanics
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/1314690.1314691openalex-snapshot
On counting homomorphisms to directed acyclic graphs
inferredcites →https://doi.org/10.1145/2213977.2214059openalex-snapshot
Complexity of counting CSP with complex weights
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
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-3-030-30786-8_28openalex-snapshot
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_6openalex-snapshot
Dichotomy Result on 3-Regular Bipartite Non-negative Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-80627-9_7openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_9openalex-snapshot
Bipartite 3-Regular Counting Problems with Mixed Signs
inferred← citeshttps://doi.org/10.1007/978-3-031-49190-0_6openalex-snapshot
Exponential Time Complexity of the Complex Weighted Boolean #CSP
inferred← citeshttps://doi.org/10.1007/978-3-031-49614-1_5openalex-snapshot
Restricted Holant Dichotomy on Domains 3 and 4
inferred← citeshttps://doi.org/10.1007/978-981-96-1093-8_31openalex-snapshot
A Combinatorial View of Holant Problems on Higher Domains
inferred← citeshttps://doi.org/10.1007/s00037-023-00237-wopenalex-snapshot
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory
inferred← citeshttps://doi.org/10.1007/s00224-021-10060-xopenalex-snapshot
The Complexity of Counting CSPd
inferred← citeshttps://doi.org/10.1007/s10589-021-00293-4openalex-snapshot
Alternating conditional gradient method for convex feasibility problems
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.1007/s11704-022-1231-5openalex-snapshot
Local holographic transformations: tractability and hardness
inferred← citeshttps://doi.org/10.1016/j.ic.2018.01.002openalex-snapshot
Holographic algorithms beyond matchgates
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104589openalex-snapshot
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104627openalex-snapshot
A structured view on weighted counting with relations to counting, quantum computation and applications
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.2026.105421openalex-snapshot
Dichotomy for Holant* problems with one ternary function on domain size 3
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.01.006openalex-snapshot
Bipartite 3-regular counting problems with mixed signs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.009openalex-snapshot
Zero-freeness and approximation of real Boolean Holant problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113745openalex-snapshot
Dichotomy result on 3-regular bipartite non-negative functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114140openalex-snapshot
Approximability of the complementarily symmetric Holant problems on cubic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114256openalex-snapshot
The computational complexity of Holant problems on 3-regular graphs
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.114931openalex-snapshot
Restricted holant dichotomy on domain sizes 3 and 4
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/s0963548321000286openalex-snapshot
Perfect matchings, rank of connection tensors and graph homomorphisms
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00105openalex-snapshot
A Dichotomy for Real Boolean Holant Problems
inferred← citeshttps://doi.org/10.1137/1.9781611975482.137openalex-snapshot
Zeros of Holant problems: locations and algorithms
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/1.9781611976465.93openalex-snapshot
New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification
inferred← citeshttps://doi.org/10.1137/17m113304xopenalex-snapshot
The Complexity of Boolean Holant Problems with Nonnegative Weights
inferred← citeshttps://doi.org/10.1145/3292048.3292050openalex-snapshot
Constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/3381425openalex-snapshot
Holant Clones and the Approximability of Conservative Holant Problems
inferred← citeshttps://doi.org/10.1145/3389390openalex-snapshot
Approximate Counting CSP Seen from the Other Side
inferred← citeshttps://doi.org/10.1145/3624704openalex-snapshot
Optimal Polynomial-Time Compression for Boolean Max CSP
inferred← citeshttps://doi.org/10.1145/3689486openalex-snapshot
Planar #CSP Equality Corresponds to Quantum Isomorphism – A Holant Viewpoint
inferred← citeshttps://doi.org/10.1145/3749740.3749756openalex-snapshot
Valiant’s Contributions to Counting Complexity
inferred← citeshttps://doi.org/10.1145/3798129.3800810openalex-snapshot
New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
inferred← citeshttps://doi.org/10.23919/ccc55666.2022.9902354openalex-snapshot
Counting Complexity of Reachability Problem for Boolean Control Networks with Free Control Sequence
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.2021.40openalex-snapshot
A Dichotomy for Real Boolean Holant Problems
inferred← citeshttps://doi.org/10.46298/theoretics.25.3openalex-snapshot
Approximate Counting for Spin Systems in Sub-Quadratic Time
inferred← citeshttps://doi.org/10.48550/arxiv.1807.09129openalex-snapshot
Zeros of Holant problems: locations and algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2011.09110openalex-snapshot
Dichotomy Result on 3-Regular Bipartite Non-negative Functions
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.