On the public citation graph

The Complexity of Symmetric Boolean Parity Holant Problems

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/bf01889919openalex-snapshot
The factorization of graphs. II
inferredcites →https://doi.org/10.1016/0095-8956(88)90068-8openalex-snapshot
General factors of graphs
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
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.ic.2006.02.002openalex-snapshot
Graph Isomorphism is in SPP
inferredcites →https://doi.org/10.1016/j.tcs.2010.10.039openalex-snapshot
A computational proof of complexity of some restricted counting problems
inferredcites →https://doi.org/10.1016/s0304-3975(01)00325-5openalex-snapshot
Expressiveness of matchgates
inferredcites →https://doi.org/10.1137/0221023openalex-snapshot
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
inferredcites →https://doi.org/10.1137/070682575openalex-snapshot
Holographic Algorithms
inferredcites →https://doi.org/10.1137/070690201openalex-snapshot
The Complexity of Weighted Boolean #CSP
inferredcites →https://doi.org/10.1137/090757496openalex-snapshot
A Complexity Dichotomy for Partition Functions with Mixed Signs
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1145/1120582.1120584openalex-snapshot
A dichotomy theorem for constraint satisfaction problems on a 3-element set
inferredcites →https://doi.org/10.1145/1314690.1314691openalex-snapshot
On counting homomorphisms to directed acyclic graphs
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility

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-1-4939-2864-4_748openalex-snapshot
Holant Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_9openalex-snapshot
Bipartite 3-Regular Counting Problems with Mixed Signs
inferred← citeshttps://doi.org/10.1007/978-3-031-49614-1_5openalex-snapshot
Restricted Holant Dichotomy on Domains 3 and 4
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_748-1openalex-snapshot
Holant Problems
inferred← citeshttps://doi.org/10.1007/978-981-96-1093-8_31openalex-snapshot
A Combinatorial View of Holant Problems on Higher Domains
inferred← citeshttps://doi.org/10.1007/s00037-015-0118-3openalex-snapshot
A Dichotomy for Real Weighted Holant Problems
inferred← citeshttps://doi.org/10.1007/s00224-021-10032-1openalex-snapshot
FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints
inferred← citeshttps://doi.org/10.1016/j.ic.2018.09.012openalex-snapshot
On blockwise symmetric matchgate signatures and higher domain #CSP
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105421openalex-snapshot
Dichotomy for Holant* problems with one ternary function on domain size 3
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.07.005openalex-snapshot
The complexity of planar Boolean #CSP with complex weights
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.01.006openalex-snapshot
Bipartite 3-regular counting problems with mixed signs
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103862openalex-snapshot
Dichotomy for real Holantc problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114256openalex-snapshot
The computational complexity of Holant problems on 3-regular graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114931openalex-snapshot
Restricted holant dichotomy on domain sizes 3 and 4
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/focs.2015.65openalex-snapshot
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k
inferred← citeshttps://doi.org/10.1109/focs.2015.81openalex-snapshot
A Holant Dichotomy: Is the FKT Algorithm Universal?
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/15m1049798openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
inferred← citeshttps://doi.org/10.1137/16m1073984openalex-snapshot
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
inferred← citeshttps://doi.org/10.1137/17m1131672openalex-snapshot
Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
inferred← citeshttps://doi.org/10.1137/17m113304xopenalex-snapshot
The Complexity of Boolean Holant Problems with Nonnegative Weights
inferred← citeshttps://doi.org/10.1137/23m1548633openalex-snapshot
Complexity Classification of Counting Graph Homomorphisms Modulo a Prime Number
inferred← citeshttps://doi.org/10.1145/2488608.2488687openalex-snapshot
A complete dichotomy rises from the capture of vanishing signatures
inferred← citeshttps://doi.org/10.1145/2635825openalex-snapshot
The complexity of counting homomorphisms to cactus graphs modulo 2
inferred← citeshttps://doi.org/10.1145/3055399.3055405openalex-snapshot
Holographic algorithm with matchgates is universal for planar #CSP over boolean domain
inferred← citeshttps://doi.org/10.1145/3305272openalex-snapshot
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
inferred← citeshttps://doi.org/10.4086/toc.2014.v010a007openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6445openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
inferred← citeshttps://doi.org/10.48550/arxiv.1212.2284openalex-snapshot
The Complexity of Planar Boolean #CSP with Complex Weights
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.