On the public citation graph
Some Results on Matchgates and Holographic Algorithms
0 signed · 45 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/11750321openalex-snapshot
Theory and applications of models of computation : Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006 : proceedings
inferredcites →https://doi.org/10.1007/11750321_24openalex-snapshot
Valiant’s Holant Theorem and Matchgate Tensors
inferredcites →https://doi.org/10.1007/3-540-44693-1_32openalex-snapshot
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_20openalex-snapshot
The Statistics of Dimers on a Lattice
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/s00224-007-9092-8openalex-snapshot
On the Theory of Matchgate Computations
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/s0304-3975(01)00325-5openalex-snapshot
Expressiveness of matchgates
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
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/0204019openalex-snapshot
Finding a Maximum Cut of a Planar Graph in Polynomial Time
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
inferredcites →https://doi.org/10.1137/s009753970139567xopenalex-snapshot
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
inferredcites →https://doi.org/10.1137/s0097539797321602openalex-snapshot
The Complexity of Counting in Sparse, Regular, and Planar Graphs
inferredcites →https://doi.org/10.1201/9781420010572.pt2openalex-snapshot
Combinatorial Matrix Theory
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-540-70918-3_37openalex-snapshot
On Symmetric Signatures in Holographic Algorithms
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/s00037-008-0248-yopenalex-snapshot
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
inferred← citeshttps://doi.org/10.1007/s00224-007-9092-8openalex-snapshot
On the Theory of Matchgate Computations
inferred← citeshttps://doi.org/10.1007/s00453-009-9383-3openalex-snapshot
Signature Theory in Holographic Algorithms
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.05.012openalex-snapshot
Holographic reduction for some counting problems
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.2019.07.005openalex-snapshot
The complexity of planar Boolean #CSP with complex weights
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.1109/ccc.2007.34openalex-snapshot
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
inferred← citeshttps://doi.org/10.1109/focs.2010.48openalex-snapshot
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP
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.48550/arxiv.0911.2907openalex-snapshot
A Recursive Definition of the Holographic Standard Signature
inferred← citeshttps://doi.org/10.48550/arxiv.1008.0683openalex-snapshot
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
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.