Back to Results
First PageMeta Content
Graph homomorphism / Matching / 2-satisfiability / Bipartite graph / Counting problem / Constraint satisfaction problem / Holographic algorithm / Graph / NP-complete / Theoretical computer science / Mathematics / Graph theory


Proving Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison May 30, 2009
Add to Reading List

Document Date: 2010-12-31 10:44:44

Open Document

File Size: 118,71 KB

Share Result on Facebook
UPDATE