Back to Results
First PageMeta Content
Mathematics / Morphisms / Complexity classes / Graph theory / Mathematical logic / Structure / Universal algebra / NP-completeness / Graph homomorphism / Bipartite graph / Homomorphism / NP


Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma
Add to Reading List

Document Date: 2011-09-12 12:52:00


Open Document

File Size: 462,47 KB

Share Result on Facebook