On the public citation graph

Corrigendum: The complexity of counting graph homomorphisms

0 signed · 26 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.1007/978-3-540-27836-8_27openalex-snapshot
The Complexity of Partition Functions
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.011openalex-snapshot
The complexity of partition functions

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20204openalex-snapshot
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
inferred← citeshttps://doi.org/10.1007/11830924_18openalex-snapshot
Approximation Algorithms for Graph Homomorphism Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-77294-1_9openalex-snapshot
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_24openalex-snapshot
From Holant to #CSP and Back: Dichotomy for Holant c Problems
inferred← citeshttps://doi.org/10.1007/s00037-015-0118-3openalex-snapshot
A Dichotomy for Real Weighted Holant Problems
inferred← citeshttps://doi.org/10.1007/s00453-012-9626-6openalex-snapshot
From Holant to #CSP and Back: Dichotomy for Holant c Problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.02.004openalex-snapshot
Efficient algorithms for counting parameterized list H-colorings
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.09.002openalex-snapshot
A dichotomy for bounded degree graph homomorphisms with nonnegative weights
inferred← citeshttps://doi.org/10.1017/s0963548321000286openalex-snapshot
Perfect matchings, rank of connection tensors and graph homomorphisms
inferred← citeshttps://doi.org/10.1109/ccc.2012.16openalex-snapshot
A Dichotomy for Real Weighted Holant Problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00106openalex-snapshot
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1109/micai-2016.2016.00024openalex-snapshot
A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs
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/100814585openalex-snapshot
Computational Complexity of Holant Problems
inferred← citeshttps://doi.org/10.1145/1536414.1536511openalex-snapshot
Holant problems and counting CSP
inferred← citeshttps://doi.org/10.1145/1806689.1806789openalex-snapshot
On the complexity of #CSP
inferred← citeshttps://doi.org/10.1145/3448641openalex-snapshot
On a Theorem of Lovász that (&sdot, H ) Determines the Isomorphism Type of H
inferred← citeshttps://doi.org/10.1145/3749740.3749756openalex-snapshot
Valiant’s Contributions to Counting Complexity
inferred← citeshttps://doi.org/10.3390/iocma2023-14434openalex-snapshot
A Branch and Bound Algorithm for Counting Independent Sets on Grid Graphs
inferred← citeshttps://doi.org/10.3390/math12060922openalex-snapshot
Counting Rules for Computing the Number of Independent Sets of a Grid Graph
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.17openalex-snapshot
On a Theorem of Lovász that $\hom(\cdot, H)$ Determines the Isomorphism Type of $H$
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.261openalex-snapshot
The #CSP Dichotomy is Decidable
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.