Quicklists
Javascript must be enabled

Sarah Schott : Computational Complexity

What does it mean for a problem to be in P, or NP? What is NP completeness? These are questions, among others, that I hope to answer in my talk on computational complexity. Computational complexity is a branch of theoretical computer science dealing with analysis of algorithms. I hope to make it as accessible as possible, with no prior knowledge of algorithms and running times.

Add to Favorites

Please select playlist name from following

Create new playlist

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.

0 Comments

Comments Disabled For This Video