On the public citation graph
The expressibility of functions on the boolean domain, with applications to counting CSPs
0 signed · 51 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.1007/978-3-642-18318-8_23openalex-snapshot
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/bf00536201openalex-snapshot
An inequality for the weights of two families of sets, their unions and intersections
inferredcites →https://doi.org/10.1007/s00453-003-1073-yopenalex-snapshot
The Relative Complexity of Approximate Counting Problems
inferredcites →https://doi.org/10.1007/s10601-009-9078-zopenalex-snapshot
Classes of submodular constraints expressible by graph cuts
inferredcites →https://doi.org/10.1016/0166-218x(85)90035-6openalex-snapshot
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
inferredcites →https://doi.org/10.1016/j.dam.2009.07.001openalex-snapshot
The expressive power of binary submodular functions
inferredcites →https://doi.org/10.1016/j.ipl.2005.06.003openalex-snapshot
Bases for Boolean co-clones
inferredcites →https://doi.org/10.1016/j.jcss.2008.02.005openalex-snapshot
Structure identification of Boolean relations and plain bases for co-clones
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.jcss.2012.04.005openalex-snapshot
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.011openalex-snapshot
The complexity of partition functions
inferredcites →https://doi.org/10.1016/j.tcs.2012.02.029openalex-snapshot
The complexity of approximately counting stable matchings
inferredcites →https://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferredcites →https://doi.org/10.1016/s0304-3975(82)80003-0openalex-snapshot
Computational complexity of real functions
inferredcites →https://doi.org/10.1017/s096354830600767xopenalex-snapshot
The Complexity of Ferromagnetic Ising with Local Fields
inferredcites →https://doi.org/10.1051/ita/1987210201751openalex-snapshot
On the complexity of computable real sequences
inferredcites →https://doi.org/10.1137/0222066openalex-snapshot
Polynomial-Time Approximation Algorithms for the Ising Model
inferredcites →https://doi.org/10.1137/070690201openalex-snapshot
The Complexity of Weighted Boolean #CSP
inferredcites →https://doi.org/10.1137/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1145/1970398.1970400openalex-snapshot
Complexity of conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1145/2371656.2371660openalex-snapshot
Approximating the partition function of the ferromagnetic Potts model
inferredcites →https://doi.org/10.1145/970831.970840openalex-snapshot
SIGACT news complexity theory column 43
inferredcites →https://doi.org/10.1287/moor.25.2.157.12225openalex-snapshot
Equivalent Representations of Set Functions
inferredcites →https://doi.org/10.1287/opre.26.2.305openalex-snapshot
Minimizing a Submodular Function on a Lattice
inferredcites →https://doi.org/10.48550/arxiv.1110.0461openalex-snapshot
LSM is not generated by binary functions
inferredcites →https://doi.org/10.5555/11534.11537openalex-snapshot
Random generation of combinatorial structures from a uniform
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/s10601-022-09340-1openalex-snapshot
The algebraic structure of the densification and the sparsification tasks for CSPs
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.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.1016/j.tcs.2021.09.009openalex-snapshot
Faster exponential-time algorithms for approximately counting independent sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.001openalex-snapshot
An FPTAS for the hardcore model on random regular bipartite graphs
inferred← citeshttps://doi.org/10.1073/pnas.1505664112openalex-snapshot
A complexity classification of spin systems with an external field
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/focs57990.2023.00121openalex-snapshot
Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract)
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch25openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.1137/140997580openalex-snapshot
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
inferred← citeshttps://doi.org/10.1145/2594538.2594559openalex-snapshot
Counting solutions to conjunctive queries
inferred← citeshttps://doi.org/10.1145/2600917openalex-snapshot
The Complexity of Approximately Counting Tree Homomorphisms
inferred← citeshttps://doi.org/10.1145/2601327openalex-snapshot
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing
inferred← citeshttps://doi.org/10.1145/2746539.2746598openalex-snapshot
FPTAS for #BIS with Degree Bounds on One Side
inferred← citeshttps://doi.org/10.1145/3381425openalex-snapshot
Holant Clones and the Approximability of Conservative Holant Problems
inferred← citeshttps://doi.org/10.1145/3799414openalex-snapshot
Hierarchies of Minion Tests for PCSPs through Tensors
inferred← citeshttps://doi.org/10.1186/s12859-019-2784-7openalex-snapshot
Fixed-parameter tractable sampling for RNA design with multiple target structures
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.