On the public citation graph

#3-Regular Bipartite Planar Vertex Cover is #P-Complete

0 signed · 18 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.1007/978-3-662-03612-9_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/pl00001601openalex-snapshot
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
inferredcites →https://doi.org/10.1016/s0304-3975(03)00080-xopenalex-snapshot
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
inferredcites →https://doi.org/10.1109/focs.2004.34openalex-snapshot
Holographic Algorithms (Extended Abstract)
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/070682575openalex-snapshot
Holographic Algorithms
inferredcites →https://doi.org/10.1137/s0097539793304601openalex-snapshot
The Complexity of Planar Counting Problems
inferredcites →https://doi.org/10.1137/s0097539797321602openalex-snapshot
The Complexity of Counting in Sparse, Regular, and Planar Graphs

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-540-72504-6_51openalex-snapshot
Maximum Edge-Disjoint Paths Problem in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_14openalex-snapshot
Planarity, Determinants, Permanents, and (Unique) Matchings
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.tcs.2007.05.023openalex-snapshot
Computational complexity of counting problems on 3-regular planar graphs
inferred← citeshttps://doi.org/10.1017/etds.2023.38openalex-snapshot
Counting independent sets in amenable groups
inferred← citeshttps://doi.org/10.1145/1714450.1714453openalex-snapshot
Planarity, Determinants, Permanents, and (Unique) Matchings
inferred← citeshttps://doi.org/10.14778/3402707.3402741openalex-snapshot
Queries with difference on probabilistic databases
inferred← citeshttps://doi.org/10.4204/eptcs.384.6openalex-snapshot
Picturing Counting Reductions with the ZH-Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1212.6935openalex-snapshot
The ODD EVEN DELTA problem is #P-hard
inferred← citeshttps://doi.org/10.48550/arxiv.1612.06954openalex-snapshot
On Dominance-Free Samples of a (Colored) Stochastic Dataset
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.