Chess theory - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2013-06-11 09:48:33 Combinatorial optimization Matching Computer chess Dominoes Planar graphs FKT algorithm Computational problems Graph theory Mathematics Theoretical computer science		Add to Reading List Source URL: www.cs.bris.ac.uk Download Document from Source Website File Size: 818,75 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
	Eccentricity, Center and Radius Computations on the Cover Graphs of Distributive Lattices with Applications to Stable Matchings Christine T. Cheng2 , Eric McDermid3 , Ichiro Suzuki4 Abstract DocID: 1oI58 - View Document
	A Holant Dichotomy: Is the FKT Algorithm Universal? Jin-Yi Cai1 , Zhiguo Fu2 , Heng Guo1 , and Tyson Williams 1 1 University of Wisconsin-Madison DocID: 1mwxP - View Document
	Graph Summarization with Quality Guarantees Matteo Riondato Stanford University David Garc´ıa-Soriano DocID: 1je7V - View Document
	A reprint from American Scientist the magazine of Sigma Xi, The Scientific Research Society DocID: azCR - View Document