On the public citation graph
A Dichotomy for Real Weighted Holant Problems
0 signed · 76 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.1002/rsa.20036openalex-snapshot
Corrigendum: The complexity of counting graph homomorphisms
inferredcites →https://doi.org/10.1007/3-540-44929-9_22openalex-snapshot
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
inferredcites →https://doi.org/10.1007/978-1-4612-0701-6openalex-snapshot
Complexity and Real Computation
inferredcites →https://doi.org/10.1007/978-1-4684-6802-1openalex-snapshot
Complexity Theory of Real Functions
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_27openalex-snapshot
The Complexity of Partition Functions
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_53openalex-snapshot
The Complexity of the Counting Constraint Satisfaction Problem
inferredcites →https://doi.org/10.1007/978-3-642-02017-9_17openalex-snapshot
A Computational Proof of Complexity of Some Restricted Counting Problems
inferredcites →https://doi.org/10.1007/978-3-642-10514-2openalex-snapshot
Tensor Geometry: The Geometric Viewpoint and Its Uses
inferredcites →https://doi.org/10.1007/978-3-642-12200-2_50openalex-snapshot
Some Observations on Holographic Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-12200-2_55openalex-snapshot
The Complexity of Counting Eulerian Tours in 4-Regular Graphs
inferredcites →https://doi.org/10.1007/978-3-642-13562-0_30openalex-snapshot
A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_24openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferredcites →https://doi.org/10.1007/978-3-642-17517-6_24openalex-snapshot
From Holant to #CSP and Back: Dichotomy for Holant c Problems
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_60openalex-snapshot
The Complexity of Symmetric Boolean Parity Holant Problems
inferredcites →https://doi.org/10.1007/bf01940872openalex-snapshot
On the Number of Eulerian Orientations of a Graph
inferredcites →https://doi.org/10.1007/bf02980577openalex-snapshot
Beitrag zur Theorie des Ferromagnetismus
inferredcites →https://doi.org/10.1007/bfb0009651openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1007/s00453-010-9463-4openalex-snapshot
The Complexity of Counting Eulerian Tours in 4-regular Graphs
inferredcites →https://doi.org/10.1007/s00453-012-9626-6openalex-snapshot
From Holant to #CSP and Back: Dichotomy for Holant c Problems
inferredcites →https://doi.org/10.1016/0095-8956(88)90079-2openalex-snapshot
On the evaluation at (3, 3) of the Tutte polynomial of a graph
inferredcites →https://doi.org/10.1016/0095-8956(90)90132-jopenalex-snapshot
On the complexity of H-coloring
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/j.ic.2006.09.005openalex-snapshot
Towards a dichotomy theorem for the counting constraint satisfaction problem
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.011openalex-snapshot
The complexity of partition functions
inferredcites →https://doi.org/10.1016/j.tcs.2009.06.003openalex-snapshot
The complexity of weighted Boolean #CSP with mixed signs
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.1017/s0305004100068936openalex-snapshot
On the computational complexity of the Jones and Tutte polynomials
inferredcites →https://doi.org/10.1109/ccc.2011.32openalex-snapshot
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
inferredcites →https://doi.org/10.1109/focs.2008.34openalex-snapshot
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness
inferredcites →https://doi.org/10.1109/focs.2010.48openalex-snapshot
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP
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/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1137/100815530openalex-snapshot
The Complexity of Symmetric Boolean Parity Holant Problems
inferredcites →https://doi.org/10.1137/110840194openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferredcites →https://doi.org/10.1137/s0097539704446797openalex-snapshot
The Computational Complexity of Tutte Invariants for Planar Graphs
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/1536414.1536511openalex-snapshot
Holant problems and counting CSP
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.4230/lipics.stacs.2010.2482openalex-snapshot
Holant Problems for Regular Graphs with Complex Edge Functions
inferredcites →https://doi.org/10.4230/lipics.stacs.2011.249openalex-snapshot
The Complexity of Weighted Boolean #CSP Modulo k
inferredcites →https://doi.org/10.4230/lipics.stacs.2011.261openalex-snapshot
The #CSP Dichotomy is Decidable
inferredcites →https://doi.org/10.48550/arxiv.0809.1836openalex-snapshot
The complexity of counting solutions to Generalised Satisfiability Problems modulo k
inferredcites →https://doi.org/10.48550/arxiv.1001.0464openalex-snapshot
Holant Problems for Regular Graphs with Complex Edge Functions
inferredcites →https://doi.org/10.5555/338219.338259openalex-snapshot
The complexity of counting graph homomorphisms (extended abstract)
inferredcites →https://doi.org/10.5860/choice.35-6275copenalex-snapshot
Complexity and real computation
inferredcites →https://doi.org/10.5948/9781614440093openalex-snapshot
The Theory of Algebraic Numbers
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-642-22006-7_60openalex-snapshot
The Complexity of Symmetric Boolean Parity Holant 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/s00037-015-0118-3openalex-snapshot
A Dichotomy for Real Weighted Holant Problems
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.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.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.9781611973402.25openalex-snapshot
A Simple FPTAS for Counting Edge Covers
inferred← citeshttps://doi.org/10.1137/15m1049798openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
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/3055399.3055405openalex-snapshot
Holographic algorithm with matchgates is universal for planar #CSP over boolean domain
inferred← citeshttps://doi.org/10.13053/cys-21-3-2244openalex-snapshot
Low-exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
inferred← citeshttps://doi.org/10.37236/12058openalex-snapshot
A Strengthening and an Efficient Implementation of Alon-Tarsi List Coloring Method
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.22openalex-snapshot
From Holant to Quantum Entanglement and Back
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.1603.07046openalex-snapshot
Holographic Algorithm with Matchgates Is Universal for Planar $\#$CSP Over Boolean Domain
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.