Ventsislav Chonev

Date: 17:00, Thursday, May 7, 2015
Speaker: Ventsislav Chonev
Venue: IST Austria

In this talk, I will give an overview of the problems I have tackled in my PhD. Most of the talk will be about the Orbit Problem and the Polyhedron-Hitting Problem, and will draw a connection with related problems on linear recurrence sequences: Skolem’s Problem and Positivity. I will give upper complexity bounds and hardness results on this problem landscape and will also offer a (hopefully painless) glimpse into the technical machinery involved. I will finish by mentioning some work in progress on continuous variants of these problems, which I’m hoping to complete in the next month or two before writing up my thesis.

Posted in RiSE Seminar