An Introduction to Complexity Theory: Why P vs NP is Really Hard | Department of Mathematics

An Introduction to Complexity Theory: Why P vs NP is Really Hard

Event Information
Event Location: 
GAB 461
Event Date: 
Wednesday, February 12, 2014 - 3:30pm

In this talk, we will introduce several of the major ideas and tools in complexity theory. We will use these notions as stepping stones along the way to proving that the P vs NP problem does not relativise.