On the public citation graph

The complexity of weighted and unweighted #CSP

0 signed · 62 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.
Claim with ORCID
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.
See reference health

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/11786986_5openalex-snapshot
On Counting Homomorphisms to Directed Acyclic Graphs
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-14165-2_24openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferredcites →https://doi.org/10.1007/s00037-010-0300-6openalex-snapshot
A Complexity Dichotomy For Hypergraph Partition Functions
inferredcites →https://doi.org/10.1007/s00453-003-1073-yopenalex-snapshot
The Relative Complexity of Approximate Counting Problems
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.ic.2011.12.007openalex-snapshot
The complexity of approximating bounded-degree Boolean #CSP
inferredcites →https://doi.org/10.1016/j.jcss.2009.08.003openalex-snapshot
An approximation trichotomy for Boolean #CSP
inferredcites →https://doi.org/10.1016/j.tcs.2009.06.003openalex-snapshot
The complexity of weighted Boolean #CSP with mixed signs
inferredcites →https://doi.org/10.1109/ccc.2011.32openalex-snapshot
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
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/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/070690201openalex-snapshot
The Complexity of Weighted Boolean #CSP
inferredcites →https://doi.org/10.1137/090757496openalex-snapshot
A Complexity Dichotomy for Partition Functions with Mixed Signs
inferredcites →https://doi.org/10.1145/1314690.1314691openalex-snapshot
On counting homomorphisms to directed acyclic graphs
inferredcites →https://doi.org/10.1145/1536414.1536511openalex-snapshot
Holant problems and counting CSP
inferredcites →https://doi.org/10.1145/1806689.1806789openalex-snapshot
On the complexity of #CSP
inferredcites →https://doi.org/10.4230/lipics.stacs.2011.261openalex-snapshot
The #CSP Dichotomy is Decidable

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-319-53733-7_15openalex-snapshot
The Weight in Enumeration
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/s00037-019-00184-5openalex-snapshot
A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
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-024-10206-7openalex-snapshot
Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s11704-022-1231-5openalex-snapshot
Local holographic transformations: tractability and hardness
inferred← citeshttps://doi.org/10.1016/j.artint.2018.06.001openalex-snapshot
The complexity of Bayesian networks specified by propositional and relational languages
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.ijar.2017.03.014openalex-snapshot
The effect of combination functions on the complexity of relational Bayesian networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.08.001openalex-snapshot
The complexity of weighted counting for acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.006openalex-snapshot
The complexity of approximating conservative counting CSPs
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.1109/ccc.2011.32openalex-snapshot
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.1109/focs.2010.49openalex-snapshot
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights
inferred← citeshttps://doi.org/10.1109/focs.2014.22openalex-snapshot
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00105openalex-snapshot
A Dichotomy for Real Boolean Holant Problems
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/100811258openalex-snapshot
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
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/17m113304xopenalex-snapshot
The Complexity of Boolean Holant Problems with Nonnegative Weights
inferred← citeshttps://doi.org/10.1145/2078162.2078177openalex-snapshot
Guest column
inferred← citeshttps://doi.org/10.1145/2213977.2214059openalex-snapshot
Complexity of counting CSP with complex weights
inferred← citeshttps://doi.org/10.1145/2528401openalex-snapshot
The expressibility of functions on the boolean domain, with applications to counting CSPs
inferred← citeshttps://doi.org/10.1145/2822891openalex-snapshot
Complexity of Counting CSP with Complex Weights
inferred← citeshttps://doi.org/10.1145/3090354.3090408openalex-snapshot
New checker for constraint network solutions
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/3632184openalex-snapshot
Bounded Degree Nonnegative Counting CSP
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.4230/lipics.esa.2016.18openalex-snapshot
Fixed-Parameter Approximability of Boolean MinCSPs
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.34openalex-snapshot
Weighted Tiling Systems for Graphs: Evaluation Complexity
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.itcs.2021.40openalex-snapshot
A Dichotomy for Real Boolean Holant Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0903.4728openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1003.3879openalex-snapshot
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
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.1110.4201openalex-snapshot
The Complexity of Weighted Counting for Acyclic Conjunctive Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1612.00675openalex-snapshot
The Weight in Enumeration
inferred← citeshttps://doi.org/10.48550/arxiv.1703.06045openalex-snapshot
Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks
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.