On the public citation graph
Holographic Algorithms
0 signed · 235 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/bf01025864openalex-snapshot
Two-dimensional monomer-dimer systems are computationally intractable
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0022-0000(80)90060-4openalex-snapshot
The node-deletion problem for hereditary properties is NP-complete
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/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
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(80)90060-2openalex-snapshot
Negation can be exponentially powerful
inferredcites →https://doi.org/10.1016/j.tcs.2004.02.003openalex-snapshot
On unique graph 3-colorability and parsimonious reductions in the plane
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/s0304-3975(01)00325-5openalex-snapshot
Expressiveness of matchgates
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.1017/s0305004100068936openalex-snapshot
On the computational complexity of the Jones and Tutte polynomials
inferredcites →https://doi.org/10.1017/s0963548300000195openalex-snapshot
The Computational Complexity of the Tutte Plane: the Bipartite Case
inferredcites →https://doi.org/10.1021/ja01315a102openalex-snapshot
The Structure and Entropy of Ice and of Other Crystals with Some Randomness of Atomic Arrangement
inferredcites →https://doi.org/10.1080/14786436108243366openalex-snapshot
Dimer problem in statistical mechanics-an exact result
inferredcites →https://doi.org/10.1098/rspa.1985.0070openalex-snapshot
Quantum theory, the Church–Turing principle and the universal quantum computer
inferredcites →https://doi.org/10.1103/physrev.124.1664openalex-snapshot
Statistical Mechanics of Dimers on a Plane Lattice
inferredcites →https://doi.org/10.1103/physrev.162.162openalex-snapshot
Residual Entropy of Square Ice
inferredcites →https://doi.org/10.1103/physrevlett.18.1046openalex-snapshot
Exact Solution of the F Model of An Antiferroelectric
inferredcites →https://doi.org/10.1103/physrevlett.18.692openalex-snapshot
Exact Solution of the Problem of the Entropy of Two-Dimensional Ice
inferredcites →https://doi.org/10.1103/physrevlett.19.108openalex-snapshot
Exact Solution of the Two-Dimensional Slater KDP Model of a Ferroelectric
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1137/0204019openalex-snapshot
Finding a Maximum Cut of a Planar Graph in Polynomial Time
inferredcites →https://doi.org/10.1137/0205049openalex-snapshot
The Planar Hamiltonian Circuit Problem is NP-Complete
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0215070openalex-snapshot
Log Depth Circuits for Division and Related Problems
inferredcites →https://doi.org/10.1137/s0036144595288554openalex-snapshot
Solving a Polynomial Equation: Some History and Recent Progress
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.1137/s0895480198338827openalex-snapshot
Determinant: Old Algorithms, New Insights
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/322326.322341openalex-snapshot
Some Exact Complexity Results for Straight-Line Computations over Semirings
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_34openalex-snapshot
#3-Regular Bipartite Planar Vertex Cover is #P-Complete
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_6openalex-snapshot
Dichotomy Result on 3-Regular Bipartite Non-negative Functions
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-540-77120-3_13openalex-snapshot
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
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-13182-0_23openalex-snapshot
Classical Simulation and Complexity of Quantum Computations
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-17458-2_24openalex-snapshot
A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs
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-18318-8_23openalex-snapshot
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_1openalex-snapshot
Progress in Complexity of Counting 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-22685-4_11openalex-snapshot
Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_13openalex-snapshot
Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities
inferred← citeshttps://doi.org/10.1007/978-3-642-23811-6_20openalex-snapshot
Statistical Mechanics on Isoradial Graphs
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_30openalex-snapshot
Counting Matchings of Size k Is $\sharp$ W[1]-Hard
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-44777-2_54openalex-snapshot
FPTAS for Counting Weighted Edge Covers
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_31openalex-snapshot
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
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-008-0248-yopenalex-snapshot
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
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/s00037-017-0160-4openalex-snapshot
Some observations on holographic algorithms
inferred← citeshttps://doi.org/10.1007/s00037-022-00226-5openalex-snapshot
Zeros and approximations of Holant polynomials on the complex plane
inferred← citeshttps://doi.org/10.1007/s00037-023-00237-wopenalex-snapshot
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory
inferred← citeshttps://doi.org/10.1007/s00220-011-1240-yopenalex-snapshot
Local Statistics of Realizable Vertex Models
inferred← citeshttps://doi.org/10.1007/s00220-021-04220-wopenalex-snapshot
Free Fermions Behind the Disguise
inferred← citeshttps://doi.org/10.1007/s00224-015-9645-1openalex-snapshot
Counting the Number of Perfect Matchings in K 5-Free Graphs
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-021-10060-xopenalex-snapshot
The Complexity of Counting CSPd
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-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.1007/s10955-019-02352-xopenalex-snapshot
Mixing Time of Markov Chains for the 1–2 Model
inferred← citeshttps://doi.org/10.1007/s11704-022-1231-5openalex-snapshot
Local holographic transformations: tractability and hardness
inferred← citeshttps://doi.org/10.1016/j.aam.2017.04.005openalex-snapshot
On the complexity of generalized chromatic polynomials
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.ejc.2017.10.005openalex-snapshot
How many delta-matroids are there?
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.ic.2018.01.003openalex-snapshot
Complexity classification of the six-vertex model
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.2020.104589openalex-snapshot
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105064openalex-snapshot
Complexity classification of the eight-vertex model
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105066openalex-snapshot
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
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.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.2019.12.003openalex-snapshot
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
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.jctb.2022.08.003openalex-snapshot
Evaluations of Tutte polynomials of regular graphs
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.06.008openalex-snapshot
Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits
inferred← citeshttps://doi.org/10.1016/j.laa.2008.10.029openalex-snapshot
Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
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.laa.2012.09.011openalex-snapshot
Preface to the special issue on tensors and multilinear algebra
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.2017.05.001openalex-snapshot
Functional clones and expressibility of partition functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.009openalex-snapshot
On the construction of graphs with a planar bipartite double cover from boolean formulas and its application to counting satisfying solutions
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.2022.03.009openalex-snapshot
Zero-freeness and approximation of real Boolean Holant problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113745openalex-snapshot
Dichotomy result on 3-regular bipartite non-negative functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114140openalex-snapshot
Approximability of the complementarily symmetric Holant problems on cubic graphs
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.114835openalex-snapshot
A complexity trichotomy for k-regular asymmetric spin systems with complex edge functions
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.1016/j.tcs.2024.114940openalex-snapshot
The complexity of ferromagnetic 2-spin systems on bounded degree graphs
inferred← citeshttps://doi.org/10.1017/s0963548321000286openalex-snapshot
Perfect matchings, rank of connection tensors and graph homomorphisms
inferred← citeshttps://doi.org/10.1088/1742-5468/2010/11/p11007openalex-snapshot
Planar graphical models which are easy
inferred← citeshttps://doi.org/10.1088/1742-5468/ab3217openalex-snapshot
Gauging variational inference*
inferred← citeshttps://doi.org/10.1088/1742-5468/abcaf0openalex-snapshot
Gauges, loops, and polynomials for partition functions of graphical models
inferred← citeshttps://doi.org/10.1088/1751-8121/aa565fopenalex-snapshot
Quantum circuits and low-degree polynomials over F 2
inferred← citeshttps://doi.org/10.1090/conm/482/09419openalex-snapshot
Contraction of matchgate tensor networks on non-planar graphs
inferred← citeshttps://doi.org/10.1093/imrn/rnx066openalex-snapshot
Critical Surface of the 1-2 Model
inferred← citeshttps://doi.org/10.1098/rspa.2008.0189openalex-snapshot
Matchgates and classical simulation of quantum circuits
inferred← citeshttps://doi.org/10.1103/clj1-v2zzopenalex-snapshot
Physically motivated guiding states for local Hamiltonians
inferred← citeshttps://doi.org/10.1103/physreva.80.052334openalex-snapshot
Quantum algorithms for spin models and simulable gate sets for quantum computation
inferred← citeshttps://doi.org/10.1103/physreva.90.032326openalex-snapshot
Efficient algorithms for maximum likelihood decoding in the surface code
inferred← citeshttps://doi.org/10.1103/physreva.94.062326openalex-snapshot
Compressed quantum metrology for the Ising Hamiltonian
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.2007.6openalex-snapshot
Bases Collapse in Holographic Algorithms
inferred← citeshttps://doi.org/10.1109/ccc.2012.16openalex-snapshot
A Dichotomy for Real Weighted Holant Problems
inferred← citeshttps://doi.org/10.1109/ccc.2014.15openalex-snapshot
Counting the Number of Perfect Matchings in K5-Free Graphs
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/focs.2014.70openalex-snapshot
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain 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.1109/focs46700.2020.00105openalex-snapshot
A Dichotomy for Real Boolean Holant Problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00128openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1109/isit.2007.4557416openalex-snapshot
Constrained Codes as Networks of Relations
inferred← citeshttps://doi.org/10.1109/isit.2015.7282625openalex-snapshot
Holographic transformation, belief propagation and loop calculus for generalized probabilistic theories
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206857openalex-snapshot
The Exact Determinant of a Specific Class of Sparse Positive Definite Matrices
inferred← citeshttps://doi.org/10.1109/tit.2008.920245openalex-snapshot
Constrained Codes as Networks of Relations
inferred← citeshttps://doi.org/10.1109/tit.2015.2403239openalex-snapshot
Loop Calculus For Nonbinary Alphabets Using Concepts From Information Geometry
inferred← citeshttps://doi.org/10.1109/tst.2014.6867521openalex-snapshot
Counting problems in parameterized complexity
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.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.1137/100815530openalex-snapshot
The Complexity of Symmetric Boolean Parity Holant Problems
inferred← citeshttps://doi.org/10.1137/110840194openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.1137/15m1032314openalex-snapshot
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
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/20m1311557openalex-snapshot
A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation
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/3034786.3056121openalex-snapshot
Conjunctive Queries on Probabilistic Graphs
inferred← citeshttps://doi.org/10.1145/3292048.3292050openalex-snapshot
Constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/3305272openalex-snapshot
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
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/3544979.3544982openalex-snapshot
Review of Complexity Dichotomies for Counting Problems Volume 1
inferred← citeshttps://doi.org/10.1145/3564246.3585173openalex-snapshot
The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3
inferred← citeshttps://doi.org/10.1145/3689486openalex-snapshot
Planar #CSP Equality Corresponds to Quantum Isomorphism – A Holant Viewpoint
inferred← citeshttps://doi.org/10.1145/3749740.3749756openalex-snapshot
Valiant’s Contributions to Counting Complexity
inferred← citeshttps://doi.org/10.1145/3798129.3800810openalex-snapshot
New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
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.1186/s40687-016-0067-8openalex-snapshot
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
inferred← citeshttps://doi.org/10.1515/nanoph-2017-0118openalex-snapshot
Metasurface holography: from fundamentals to applications
inferred← citeshttps://doi.org/10.21468/scipost.report.1238openalex-snapshot
Report on scipost_201908_00005v1
inferred← citeshttps://doi.org/10.21468/scipostphys.7.5.060openalex-snapshot
Fast counting with tensor networks
inferred← citeshttps://doi.org/10.22331/q-2020-06-04-278openalex-snapshot
Characterization of solvable spin models via graph invariants
inferred← citeshttps://doi.org/10.22331/q-2020-08-13-307openalex-snapshot
Quantum-inspired algorithms in practice
inferred← citeshttps://doi.org/10.22331/q-2021-03-15-410openalex-snapshot
Hyper-optimized tensor network contraction
inferred← citeshttps://doi.org/10.26421/qic15.3-4-3openalex-snapshot
Quantum circuits and Spin(3n) groups
inferred← citeshttps://doi.org/10.26421/qic15.7-8-1openalex-snapshot
Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation
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.22openalex-snapshot
From Holant to Quantum Entanglement and Back
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.23openalex-snapshot
Counting Perfect Matchings and the Eight-Vertex Model
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.7openalex-snapshot
Tensor Network Complexity of Multilinear Maps
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.40openalex-snapshot
A Dichotomy for Real Boolean Holant Problems
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1368openalex-snapshot
A Theory for Valiant's Matchcircuits (Extended Abstract)
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2482openalex-snapshot
Holant Problems for Regular Graphs with Complex Edge Functions
inferred← citeshttps://doi.org/10.48550/arxiv.0705.3751openalex-snapshot
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
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.0911.2907openalex-snapshot
A Recursive Definition of the Holographic Standard Signature
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0464openalex-snapshot
Holant Problems for Regular Graphs with Complex Edge Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1007.0391openalex-snapshot
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1108.3383openalex-snapshot
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
inferred← citeshttps://doi.org/10.48550/arxiv.1109.5789openalex-snapshot
Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3306openalex-snapshot
Simulating Special but Natural Quantum Circuits
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.1303.2168openalex-snapshot
New Understanding of the Bethe Approximation and the Replica Method
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.1401.6500openalex-snapshot
Holographic Transformation for Quantum Factor Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.4020openalex-snapshot
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7381openalex-snapshot
On computation with 'probabilities' modulo k
inferred← citeshttps://doi.org/10.48550/arxiv.1603.07046openalex-snapshot
Holographic Algorithm with Matchgates Is Universal for Planar $\#$CSP Over Boolean Domain
inferred← citeshttps://doi.org/10.48550/arxiv.1807.09129openalex-snapshot
Zeros of Holant problems: locations and algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2010.05425openalex-snapshot
FPRAS via MCMC where it mixes torpidly (and very little effort)
inferred← citeshttps://doi.org/10.48550/arxiv.2011.09110openalex-snapshot
Dichotomy Result on 3-Regular Bipartite Non-negative Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2108.12879openalex-snapshot
Parameterizing the Permanent: Hardness for $K_8$-minor-free graphs
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.