On the public citation graph

Bases Collapse in Holographic Algorithms

0 signed · 39 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11523468_1openalex-snapshot
Holographic Circuits
inferredcites →https://doi.org/10.1007/11533719_1openalex-snapshot
Completeness for Parity Problems
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/978-3-540-73420-8_55openalex-snapshot
Holographic Algorithms: The Power of Dimensionality Resolved
inferredcites →https://doi.org/10.1007/978-3-540-74240-1_17openalex-snapshot
On Block-Wise Symmetric Signatures for Matchgates
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/bf01025864openalex-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.1016/0031-8914(61)90063-5openalex-snapshot
The statistics of dimers on a lattice
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/0211025openalex-snapshot
Planar Formulae and Their Uses
inferredcites →https://doi.org/10.1137/070682575openalex-snapshot
Holographic Algorithms
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
inferredcites →https://doi.org/10.1145/1250790.1250850openalex-snapshot
Holographic algorithms
inferredcites →https://doi.org/10.1511/2008.69.9openalex-snapshot
Accidental Algorithms
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0108033openalex-snapshot
Fermionic Linear Optics and Matchgates

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-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/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/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.laa.2011.02.032openalex-snapshot
Holographic algorithms by Fibonacci gates
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/bsc.2010.5473006openalex-snapshot
On Holant theorem and its proof
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/1250790.1250850openalex-snapshot
Holographic algorithms
inferred← citeshttps://doi.org/10.1145/1388240.1388254openalex-snapshot
Holographic algorithms
inferred← citeshttps://doi.org/10.1145/2897518.2897560openalex-snapshot
Base collapse of holographic algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.0810.3940openalex-snapshot
Report on "Geometry and representation theory of tensors for computer science, statistics and other areas."
inferred← citeshttps://doi.org/10.48550/arxiv.1005.1349openalex-snapshot
On Holant Theorem and Its Proof
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3306openalex-snapshot
Simulating Special but Natural Quantum Circuits
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.