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.

**Category**: Graduate/Faculty Seminar**Duration**: 01:34:50**Date**: March 20, 2009 at 4:25 PM-
**Tags:**seminar, Graduate/faculty Seminar

## 0 Comments