On the public citation graph
Accidental Algorthims
0 signed · 119 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/11750321_24openalex-snapshot
Valiant’s Holant Theorem and Matchgate Tensors
inferredcites →https://doi.org/10.1007/bf01010403openalex-snapshot
Two-dimensional monomer-dimer systems are computationally intractable
inferredcites →https://doi.org/10.1007/bfb0009651openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/s0304-3975(99)00288-1openalex-snapshot
Fanout limitations on constraint systems
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1109/focs.2004.34openalex-snapshot
Holographic Algorithms (Extended Abstract)
inferredcites →https://doi.org/10.1109/sfcs.1991.185366openalex-snapshot
Exact learning of read-twice DNF formulas
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0219003openalex-snapshot
The Complexity of Very Simple Boolean Formulas with Applications
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
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
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.5555/314161.314263openalex-snapshot
Graph orientations with no sink and an approximation for a hard case of #SAT
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11750321_24openalex-snapshot
Valiant’s Holant Theorem and Matchgate Tensors
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-030-90048-9_6openalex-snapshot
Barnette’s Conjecture Through the Lens of the $$Mod_{k}P$$ Complexity Classes
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-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_37openalex-snapshot
On Symmetric Signatures in Holographic Algorithms
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-73420-8_55openalex-snapshot
Holographic Algorithms: The Power of Dimensionality Resolved
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_17openalex-snapshot
On Block-Wise Symmetric Signatures for Matchgates
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_51openalex-snapshot
Signature Theory in Holographic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_47openalex-snapshot
Classification of a Class of Counting Problems Using Holographic Reductions
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_50openalex-snapshot
Some Observations on Holographic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_24openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_56openalex-snapshot
Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems
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/978-3-642-22006-7_60openalex-snapshot
The Complexity of Symmetric Boolean Parity Holant Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_746-1openalex-snapshot
Holographic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_35openalex-snapshot
Holographic Algorithms on Domain Size k > 2
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_1openalex-snapshot
Complexity Dichotomy for Counting Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_44openalex-snapshot
The Complexity of Planar Boolean #CSP with Complex Weights
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_23openalex-snapshot
Holographic Algorithms Beyond Matchgates
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_52openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
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/978-981-97-2340-9_18openalex-snapshot
On the Power of Counting the Total Number of Computation Paths of NPTMs
inferred← citeshttps://doi.org/10.1007/s00037-008-0248-yopenalex-snapshot
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
inferred← citeshttps://doi.org/10.1007/s00037-008-0249-xopenalex-snapshot
Basis Collapse in Holographic Algorithms
inferred← citeshttps://doi.org/10.1007/s00037-012-0044-6openalex-snapshot
Holographic reduction, interpolation and hardness
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-007-9092-8openalex-snapshot
On the Theory of Matchgate Computations
inferred← citeshttps://doi.org/10.1007/s00224-020-09983-8openalex-snapshot
Dichotomy for Holant∗ Problems on the Boolean Domain
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.1007/s00224-022-10088-7openalex-snapshot
Holographic Algorithms on Domains of General Size
inferred← citeshttps://doi.org/10.1007/s00224-024-10206-7openalex-snapshot
Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02671-7openalex-snapshot
Undirected Determinant and Its Complexity
inferred← citeshttps://doi.org/10.1007/s00453-007-9097-3openalex-snapshot
Algorithms for Modular Counting of Roots of Multivariate Polynomials
inferred← citeshttps://doi.org/10.1007/s00453-009-9383-3openalex-snapshot
Signature Theory in Holographic Algorithms
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.1007/s11704-022-1231-5openalex-snapshot
Local holographic transformations: tractability and hardness
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111842openalex-snapshot
Counting degree-constrained subgraphs and orientations
inferred← citeshttps://doi.org/10.1016/j.ic.2012.08.002openalex-snapshot
Approximate counting for complex-weighted Boolean constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.002openalex-snapshot
A collapse theorem for holographic algorithms with matchgates on domain size at most 4
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104589openalex-snapshot
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS
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.ipl.2014.06.006openalex-snapshot
Holographic algorithms on bases of rank 2
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.005openalex-snapshot
Holographic algorithms: From art to science
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.07.003openalex-snapshot
The complexity of complex weighted Boolean #CSP
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.08.003openalex-snapshot
Meta-kernelization with structural parameters
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103862openalex-snapshot
Dichotomy for real Holantc problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.08.003openalex-snapshot
Evaluations of Tutte polynomials of regular graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2011.02.032openalex-snapshot
Holographic algorithms by Fibonacci gates
inferred← citeshttps://doi.org/10.1016/j.laa.2012.01.010openalex-snapshot
Holographic algorithms without matchgates
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.1016/j.tcs.2008.12.047openalex-snapshot
Holographic algorithms: The power of dimensionality resolved
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.037openalex-snapshot
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.036openalex-snapshot
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.042openalex-snapshot
Computing the Tutte polynomial of lattice path matroids using determinantal circuits
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.2007.34openalex-snapshot
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
inferred← citeshttps://doi.org/10.1109/ccc.2012.16openalex-snapshot
A Dichotomy for Real Weighted Holant Problems
inferred← citeshttps://doi.org/10.1109/focs.2010.48openalex-snapshot
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00103openalex-snapshot
MAJORITY-3SAT (and Related Problems) in Polynomial Time
inferred← citeshttps://doi.org/10.1109/lics.2019.8785678openalex-snapshot
A short story of the CSP dichotomy conjecture
inferred← citeshttps://doi.org/10.1137/1.9781611973105.4openalex-snapshot
Approximate Counting via Correlation Decay on Planar Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973105.93openalex-snapshot
Dichotomy for Holant Problems with a Function on Domain Size 3
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/15m1049798openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
inferred← citeshttps://doi.org/10.1137/20m1382921openalex-snapshot
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.1145/1536414.1536511openalex-snapshot
Holant problems and counting CSP
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/2897518.2897546openalex-snapshot
Basis collapse for holographic algorithms over all domain sizes
inferred← citeshttps://doi.org/10.1145/2897518.2897560openalex-snapshot
Base collapse of holographic algorithms
inferred← citeshttps://doi.org/10.1145/2898441openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.1145/2940323openalex-snapshot
On Hardness of Multilinearization and VNP-Completeness in Characteristic 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/3292048.3292050openalex-snapshot
Constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/3460958openalex-snapshot
Counting Homomorphisms to Trees Modulo a Prime
inferred← citeshttps://doi.org/10.1162/neco_a_00441openalex-snapshot
Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
inferred← citeshttps://doi.org/10.4204/eptcs.384.6openalex-snapshot
Picturing Counting Reductions with the ZH-Calculus
inferred← citeshttps://doi.org/10.4230/lipics.esa.2017.63openalex-snapshot
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.5openalex-snapshot
On the Fine-Grained Complexity of Parity Problems
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.59openalex-snapshot
Counting Homomorphisms Modulo a Prime Number
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.249openalex-snapshot
The Complexity of Weighted Boolean #CSP Modulo k
inferred← citeshttps://doi.org/10.48550/arxiv.0809.1836openalex-snapshot
The complexity of counting solutions to Generalised Satisfiability Problems modulo k
inferred← citeshttps://doi.org/10.48550/arxiv.0903.4728openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0803openalex-snapshot
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems
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.1205.4124openalex-snapshot
The permanent, graph gadgets and counting solutions for certain types of planar formulas
inferred← citeshttps://doi.org/10.48550/arxiv.1212.2284openalex-snapshot
The Complexity of Planar Boolean #CSP with Complex Weights
inferred← citeshttps://doi.org/10.48550/arxiv.1307.7430openalex-snapshot
Holographic Algorithms Beyond Matchgates
inferred← citeshttps://doi.org/10.48550/arxiv.1309.4033openalex-snapshot
The complexity of parity graph homomorphism: an initial investigation
inferred← citeshttps://doi.org/10.48550/arxiv.2108.13090openalex-snapshot
Undirected determinant, permanent and their complexity
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.