On the public citation graph
A Complexity Trichotomy for Approximately Counting List H -Colorings
0 signed · 32 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.1002/jgt.10073openalex-snapshot
Bi‐arc graphs and the complexity of list homomorphisms
inferredcites →https://doi.org/10.1002/jgt.20006openalex-snapshot
Interval bigraphs and circular arc graphs
inferredcites →https://doi.org/10.1006/jcss.1995.1039openalex-snapshot
Descriptive Complexity of #P Functions
inferredcites →https://doi.org/10.1006/jctb.1997.1812openalex-snapshot
List Homomorphisms to Reflexive Graphs
inferredcites →https://doi.org/10.1007/s00453-003-1073-yopenalex-snapshot
The Relative Complexity of Approximate Counting Problems
inferredcites →https://doi.org/10.1007/s004939970003openalex-snapshot
List Homomorphisms and Circular Arc Graphs
inferredcites →https://doi.org/10.1016/0166-218x(87)90064-3openalex-snapshot
Short proof of a discrete gronwall inequality
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/j.aml.2007.04.001openalex-snapshot
A matrix characterization of interval and proper interval graphs
inferredcites →https://doi.org/10.1016/j.jcss.2014.06.006openalex-snapshot
The complexity of approximating conservative counting CSPs
inferredcites →https://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
inferredcites →https://doi.org/10.1017/s0963548315000401openalex-snapshot
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
inferredcites →https://doi.org/10.1073/pnas.1505664112openalex-snapshot
A complexity classification of spin systems with an external field
inferredcites →https://doi.org/10.1109/focs.2010.34openalex-snapshot
Computational Transition at the Uniqueness Threshold
inferredcites →https://doi.org/10.1137/0222066openalex-snapshot
Polynomial-Time Approximation Algorithms for the Ising Model
inferredcites →https://doi.org/10.1137/1.9781611973099.74openalex-snapshot
Approximate Counting via Correlation Decay in Spin Systems
inferredcites →https://doi.org/10.1137/1.9781611974331.ch138openalex-snapshot
On the switch Markov chain for perfect matchings
inferredcites →https://doi.org/10.1137/15m1020551openalex-snapshot
Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard
inferredcites →https://doi.org/10.1145/1132516.1132538openalex-snapshot
Counting independent sets up to the tree threshold
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-59267-7_22openalex-snapshot
Characterizations and Approximability of Hard Counting Classes Below $$\#\mathsf {P}$$
inferred← citeshttps://doi.org/10.1137/1.9781611975994.135openalex-snapshot
Approximately counting and sampling small witnesses using a colourful decision oracle
inferred← citeshttps://doi.org/10.1137/1.9781611976465.137openalex-snapshot
Counting Homomorphisms to K 4 -minor-free Graphs, modulo 2
inferred← citeshttps://doi.org/10.1137/19m130604xopenalex-snapshot
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
inferred← citeshttps://doi.org/10.1137/20m1382921openalex-snapshot
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.1145/3389390openalex-snapshot
Approximate Counting CSP Seen from the Other Side
inferred← citeshttps://doi.org/10.1145/3397472openalex-snapshot
The Complexity of Approximately Counting Retractions
inferred← citeshttps://doi.org/10.1145/3458040openalex-snapshot
The Complexity of Approximately Counting Retractions to Square-free Graphs
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.59openalex-snapshot
Counting Homomorphisms Modulo a Prime Number
inferred← citeshttps://doi.org/10.48550/arxiv.2003.02524openalex-snapshot
Characterizations and approximability of hard counting classes below #P
inferred← citeshttps://doi.org/10.70675/5842ba53z380ez4b64z9aeczdee2a5b2e32fopenalex-snapshot
Fine-Grained and Parameterized Complexity of Graph Coloring Problems
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.