# A gentle introduction to the complexity of knots

Janos Makowsky Technion, Haifa, Israel 4pm, Thursday 7 September 2000 Room 2511, JCMB, King's Buildings

The mathematical theory of knots gives rise to computational problems whose complexity is not always easy to establish. For example, given two knots, represented as "crossing diagrams" (that is, a list of line segments with over/under information), are they the same abstract knot? This talk will introduce mathematical knots and some of their complexity problems.