On the public citation graph
Holographic algorithms: From art to science
0 signed · 92 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/bf01010403openalex-snapshot
Two-dimensional monomer-dimer systems are computationally intractable
inferredcites →https://doi.org/10.1007/s00037-008-0249-xopenalex-snapshot
Basis Collapse in Holographic Algorithms
inferredcites →https://doi.org/10.1007/s00224-007-9092-8openalex-snapshot
On the Theory of Matchgate Computations
inferredcites →https://doi.org/10.1007/s00493-004-0011-1openalex-snapshot
A Combinatorial Proof of Kneser’s Conjecture*
inferredcites →https://doi.org/10.1016/0031-8914(61)90063-5openalex-snapshot
The statistics of dimers on a lattice
inferredcites →https://doi.org/10.1016/0097-3165(78)90022-5openalex-snapshot
Kneser's conjecture, chromatic number, and homotopy
inferredcites →https://doi.org/10.1016/j.tcs.2007.05.023openalex-snapshot
Computational complexity of counting problems on 3-regular planar graphs
inferredcites →https://doi.org/10.1016/j.tcs.2008.12.047openalex-snapshot
Holographic algorithms: The power of dimensionality resolved
inferredcites →https://doi.org/10.1016/s0304-3975(01)00325-5openalex-snapshot
Expressiveness of matchgates
inferredcites →https://doi.org/10.1080/14786436108243366openalex-snapshot
Dimer problem in statistical mechanics-an exact result
inferredcites →https://doi.org/10.1109/focs.2004.34openalex-snapshot
Holographic Algorithms (Extended Abstract)
inferredcites →https://doi.org/10.1137/0602037openalex-snapshot
Incidence Matrices of Subsets—A Rank Formula
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
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.1214/aos/1176343949openalex-snapshot
On Theory and Applications of BIB Designs with Repeated Blocks
inferredcites →https://doi.org/10.1214/aos/1176344743openalex-snapshot
Note: Correction to "On Theory and Application of BIB Designs with Repeated Blocks"
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-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-031-62273-1_4openalex-snapshot
Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_53openalex-snapshot
The Complexity of the Counting Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_11openalex-snapshot
Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction 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-35261-4_27openalex-snapshot
Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs
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-43948-7_65openalex-snapshot
FPTAS for Weighted Fibonacci Gates and Its Applications
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-96-4448-3_14openalex-snapshot
Fair Selection of Clearing Schemes for Kidney Exchange Markets
inferred← citeshttps://doi.org/10.1007/s00037-012-0044-6openalex-snapshot
Holographic reduction, interpolation and hardness
inferred← citeshttps://doi.org/10.1007/s00224-013-9518-4openalex-snapshot
Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/s00224-016-9671-7openalex-snapshot
Holant Problems for 3-Regular Graphs with Complex Edge Functions
inferred← citeshttps://doi.org/10.1007/s00224-018-9893-yopenalex-snapshot
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes
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/s00453-012-9626-6openalex-snapshot
From Holant to #CSP and Back: Dichotomy for Holant c Problems
inferred← citeshttps://doi.org/10.1007/s00453-021-00805-yopenalex-snapshot
Parameterized Counting of Partially Injective Homomorphisms
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100837openalex-snapshot
Parameterised counting complexity theory
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111842openalex-snapshot
Counting degree-constrained subgraphs and orientations
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115024openalex-snapshot
Counting degree-constrained 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.2018.01.002openalex-snapshot
Holographic algorithms beyond matchgates
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.2013.07.003openalex-snapshot
The complexity of complex weighted Boolean #CSP
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.jctb.2022.08.003openalex-snapshot
Evaluations of Tutte polynomials of regular graphs
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.01.021openalex-snapshot
Spin systems on k -regular graphs with complex edge functions
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.2012.12.043openalex-snapshot
Partition functions on k -regular graphs with { 0 , 1 } -vertex assignments and real edge functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.010openalex-snapshot
Clifford gates in the Holant framework
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.1038/srep01235openalex-snapshot
Solving search problems by strongly simulating quantum circuits
inferred← citeshttps://doi.org/10.1109/focs.2008.34openalex-snapshot
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness
inferred← citeshttps://doi.org/10.1109/focs.2015.81openalex-snapshot
A Holant Dichotomy: Is the FKT Algorithm Universal?
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00128openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1109/tit.2010.2094870openalex-snapshot
Normal Factor Graphs and Holographic Transformations
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.9781611975482.30openalex-snapshot
Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms
inferred← citeshttps://doi.org/10.1137/1.9781611977066.23openalex-snapshot
Parameterizing the Permanent: Hardness for fixed excluded minors
inferred← citeshttps://doi.org/10.1137/100814585openalex-snapshot
Computational Complexity of Holant Problems
inferred← citeshttps://doi.org/10.1137/15m1049798openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
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/20m1365624openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1145/2090236.2090272openalex-snapshot
Gadgets and anti-gadgets leading to a complexity dichotomy
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/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/3305272openalex-snapshot
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
inferred← citeshttps://doi.org/10.1145/3460958openalex-snapshot
Counting Homomorphisms to Trees Modulo a Prime
inferred← citeshttps://doi.org/10.1145/3749740.3749756openalex-snapshot
Valiant’s Contributions to Counting Complexity
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
inferred← citeshttps://doi.org/10.48550/arxiv.1303.7361openalex-snapshot
Holographaic Alogorithms on Bases of Rank 2
inferred← citeshttps://doi.org/10.48550/arxiv.1307.7430openalex-snapshot
Holographic Algorithms Beyond Matchgates
inferred← citeshttps://doi.org/10.48550/arxiv.1501.07539openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
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.