Event Detail

Event Type: 
Number Theory Seminar
Date/Time: 
Tuesday, May 1, 2018 - 16:00 to 17:00
Location: 
BEXL 207

Speaker Info

Institution: 
Portland State University
Abstract: 

Many decision problems can be modeled as constraint satisfaction problems (CSPs). In this talk, I will discuss a class of CSPs whose computational complexity can be classified using algebraic and Ramsey theoretic techniques, giving examples with graphs and permutations.