On the public citation graph

The complexity of approximating conservative counting CSPs

0 signed · 48 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.1006/inco.1996.0016openalex-snapshot
Complexity of Generalized Satisfiability Counting Problems
inferredcites →https://doi.org/10.1007/3-540-44436-x_12openalex-snapshot
On the Relative Complexity of Approximate Counting Problems
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_17openalex-snapshot
Soft Constraints: Complexity and Multimorphisms
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-18318-8_23openalex-snapshot
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/bf01415751openalex-snapshot
The cone of Monge matrices: Extremal rays and applications
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.artint.2006.04.002openalex-snapshot
The complexity of soft constraint satisfaction
inferredcites →https://doi.org/10.1016/j.ic.2012.08.002openalex-snapshot
Approximate counting for complex-weighted Boolean constraint satisfaction problems
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.jcss.2011.12.002openalex-snapshot
The complexity of weighted and unweighted #CSP
inferredcites →https://doi.org/10.1016/j.tcs.2008.03.015openalex-snapshot
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
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.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferredcites →https://doi.org/10.1017/cbo9780511566059.004openalex-snapshot
Combinatorial Nullstellensatz
inferredcites →https://doi.org/10.1017/cbo9780511813603openalex-snapshot
Probability and Computing
inferredcites →https://doi.org/10.1017/s0963548398003411openalex-snapshot
Combinatorial Nullstellensatz
inferredcites →https://doi.org/10.1109/ccc.2011.32openalex-snapshot
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
inferredcites →https://doi.org/10.1137/070690201openalex-snapshot
The Complexity of Weighted Boolean #CSP
inferredcites →https://doi.org/10.1137/1.9781611973082.132openalex-snapshot
Dichotomy for Holant Problems of Boolean Domain
inferredcites →https://doi.org/10.1137/100811258openalex-snapshot
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
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.1145/2078162.2078177openalex-snapshot
Guest column
inferredcites →https://doi.org/10.1145/2213977.2214059openalex-snapshot
Complexity of counting CSP with complex weights
inferredcites →https://doi.org/10.1145/2371656.2371660openalex-snapshot
Approximating the partition function of the ferromagnetic Potts model
inferredcites →https://doi.org/10.1145/2450142.2450146openalex-snapshot
The complexity of conservative valued CSPs
inferredcites →https://doi.org/10.1145/2528401openalex-snapshot
The expressibility of functions on the boolean domain, with applications to counting CSPs
inferredcites →https://doi.org/10.1287/opre.26.2.305openalex-snapshot
Minimizing a Submodular Function on a Lattice
inferredcites →https://doi.org/10.1613/jair.1400openalex-snapshot
A Maximal Tractable Class of Soft Constraints
inferredcites →https://doi.org/10.4230/lipics.stacs.2010.2493openalex-snapshot
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.302openalex-snapshot
Log-supermodular functions, functional clones and counting CSPs
inferredcites →https://doi.org/10.48550/arxiv.0708.3226openalex-snapshot
A Dichotomy Theorem for General Minimum Cost Homomorphism Problem
inferredcites →https://doi.org/10.48550/arxiv.1012.5659openalex-snapshot
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00454-022-00406-8openalex-snapshot
Counting Vertices of Integral Polytopes Defined by Facets
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.009openalex-snapshot
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.12.003openalex-snapshot
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.001openalex-snapshot
Functional clones and expressibility of partition functions
inferred← citeshttps://doi.org/10.1073/pnas.1505664112openalex-snapshot
A complexity classification of spin systems with an external field
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch25openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.1145/2450142.2450146openalex-snapshot
The complexity of conservative valued CSPs
inferred← citeshttps://doi.org/10.1145/3037381openalex-snapshot
A Complexity Trichotomy for Approximately Counting List H -Colorings
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/3799414openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4839openalex-snapshot
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07361openalex-snapshot
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
inferred← citeshttps://doi.org/10.48550/arxiv.2004.10805openalex-snapshot
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models
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.