Aliénor Edström Bourdeau: P vs NP

Abstract.

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