Skip to main content
To KTH's start page To KTH's start page

Aliénor Edström Bourdeau: P vs NP

Bachelor thesis presentation

Time: Fri 2023-08-25 11.30 - 12.30

Location: Cramer room

Respondent: Aliénor Edström Bourdeau

Supervisor: Per Alexandersson

Export to calendar


Here you will find a —hopefully— easy-to-read introduction to the P vs NP problem. I explain the basics, Turing machines, complexity classes and terminology. Following up are some techniques and advancement that have been made in the field and the sketches of some illustrating proofs