Graduate/faculty Seminar
Friday, March 20, 2009, 4:30pm, 119 Physics
Sarah Schott
Computational Complexity
Abstract:- 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. [video]
Generated at 10:19pm Tuesday, April 23, 2024 by Mcal. Top
* Reload
* Login