Geodesics in Groups and Computational Complexity
Time and place
1 PM on Wednesday, March 17th, 2010; NAC 1511
Alexander Ushakov (Stevens Institute)
Abstract
In this talk I will discuss several versions of the problem of finding geodesics in groups. I will give motivating examples for studying these problems and show connections with other areas of mathematics and computer science, including cryptography. I will also discuss computational complexity of these problems in some particular classes of groups.
