Holographic algorithm - PDFSEARCH.IO - Document Search Engine

Holographic algorithm
Results: 10

#	Item
1	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 Language: English - 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
2	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, Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2015-11-27 02:29:00 Tree decomposition Constraint programming Treewidth Dynamical systems Linear algebra Decomposition method Holographic algorithm
3	Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP Jin-Yi Cai∗ Pinyan Lu† Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-07-10 15:34:42 Combinatorial optimization Matching Planar graph Structure Vertex cover Holographic algorithm Tutte polynomial Robertson–Seymour theorem Graph theory Mathematics Theoretical computer science
4	Proving Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison May 30, 2009 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-12-31 10:44:44 Graph homomorphism Matching 2-satisfiability Bipartite graph Counting problem Constraint satisfaction problem Holographic algorithm Graph NP-complete Theoretical computer science Mathematics Graph theory
5	A reprint from American Scientist the magazine of Sigma Xi, The Scientific Research Society Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2007-12-13 00:24:46 Complexity classes Mathematical optimization Linear algebra Permutations Matching NP-complete Holographic algorithm Computing the permanent FKT algorithm Theoretical computer science Mathematics Computational complexity theory
6	Some Results on Matchgates and Holographic Algorithms Jin-Yi Cai Vinay Choudhary Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2006-09-29 00:40:45 Combinatorial optimization Matching Bipartite graph Planar graphs Graph FKT algorithm Tutte polynomial Graph theory Mathematics Computational problems
7	Some Results on Matchgates and Holographic Algorithms Jin-Yi Cai 1 Vinay Choudhary 2 Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2006-02-12 22:13:48 FKT algorithm Computational problems Pfaffian Matching Minor Adjacency matrix Planarity Tutte polynomial Tree decomposition Graph theory Mathematics Planar graphs
8	Algorithmica[removed]:779–816 DOI[removed]s00453[removed]Signature Theory in Holographic Algorithms Jin-Yi Cai · Pinyan Lu Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2012-12-08 13:40:56 Tensors FKT algorithm Holographic algorithm Tensor product Tensor Pfaffian Algebra Linear algebra Mathematics
9	Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed] Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2007-09-05 18:26:13 NP-complete problems Complexity classes Holographic algorithm NP-complete Matching FKT algorithm NP-hard P versus NP problem NP Theoretical computer science Computational complexity theory Mathematics