HOLOGRAPHIC ALGORITHMS WITHOUT MATCHGATES J.M. LANDSBERG, JASON MORTON AND SERGUEI NORINE Abstract. The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems,

First Page		Document Content
Date: 2011-12-07 13:28:26 Algebra Mathematics Linear algebra Determinants Multilinear algebra Pfaffian FKT algorithm Skew-symmetric matrix Matrix Tensor Holographic algorithm Antisymmetric		HOLOGRAPHIC ALGORITHMS WITHOUT MATCHGATES J.M. LANDSBERG, JASON MORTON AND SERGUEI NORINE Abstract. The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, Add to Reading List Source URL: www.math.tamu.edu Download Document from Source Website File Size: 395,33 KB Share Document on Facebook

	HOLOGRAPHIC ALGORITHMS WITHOUT MATCHGATES J.M. LANDSBERG, JASON MORTON AND SERGUEI NORINE Abstract. The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, DocID: 1pQ8p - View Document
	Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth∗ Petr Kolman, Martin Kouteck´ y Department of Applied Mathematics, Faculty of Mathematics and Physics, DocID: 1peWm - View Document
	Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP Jin-Yi Cai∗ Pinyan Lu† DocID: aBkY - View Document
	Proving Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison May 30, 2009 DocID: aAFl - View Document