Valiant’s Holant Theorem and matchgate tensors
Authors:
- Jin-Yi CaiJCJin-Yi Cai
- Vinay ChoudharyVCVinay Choudhary
- 1 September 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 384 (1) , 22-32
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the Theory of Matchgate Computations2007
- Bases Collapse in Holographic AlgorithmsTwenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007
- On Symmetric Signatures in Holographic Algorithms2007
- Expressiveness of matchgatesTheoretical Computer Science, 2002
- The gap between monotone and non-monotone circuit complexity is exponentialCombinatorica, 1988
- Some Exact Complexity Results for Straight-Line Computations over SemiringsJournal of the ACM, 1982
- Negation can be exponentially powerfulTheoretical Computer Science, 1980
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- The statistics of dimers on a latticePhysica, 1961
- Dimer problem in statistical mechanics-an exact resultPhilosophical Magazine, 1961