Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University - Complexity of constraint satisfaction - Document - PDFSEARCH.IO

First Page	Meta Content
	Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University Add to Reading List Document Date: 2011-07-11 20:52:11 Open Document File Size: 208,59 KB Share Result on Facebook Company Vertex / Microsoft / / Country Sudan / / Facility University Pinyan Lu Microsoft Research Asia / Counting Problems Jin-Yi Cai University of Wisconsin / / Organization Columbia University / Counting Problems Jin-Yi Cai University / University of Wisconsin / Madison / / Person Ai / / Position Counting PM / / ProvinceOrState Wisconsin / / Technology html / / URL http / SocialTag Graph theory Computational problems NP-complete problems Constraint programming Graph coloring 2-satisfiability NP-complete Graph homomorphism Constraint satisfaction problem Theoretical computer science

Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia UniversityAdd to Reading List