An Introduction to Computational Complexity

Speaker: Victor Khomenko

9th December 2005 , 1pm , E4, Basement, Merz Court, School of EECE

Abstract

This talk is intended as a very basic introduction into the subject of computational complexity. Issues such as P vs. NP problem, or, say, that sorting can be done in O(n log n) worst case time, will be discussed.