Pavol Hell (SFU)

Combinatorial dichotomy classifications
Speaker:
Pavol Hell (Simon Fraser University, Computing Science)

Abstract:
In classifying the complexity of certain homomorphism problems, it sometimes turns out that it is the presence of a combinatorial obstruction in the target structure that causes a problem to become intractable. I will discuss several recent results of this type, including recent joint work with L. Egri, B. Larose, and A. Rafiey.

Date:
Wednesday, August 7, 2013

Time:

10:15 am - 11:00 am

Location:
The IRMACS Centre, Simon Fraser University, Burnaby