Date: 2014-12-24 18:09:21Computational complexity theory Theory of computation Mathematics Analysis of algorithms Operations research Mathematical optimization NP-complete problems Smoothed analysis Algorithm Competitive analysis Best worst and average case Time complexity | | CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1Add to Reading ListSource URL: theory.stanford.eduDownload Document from Source Website File Size: 60,77 KBShare Document on Facebook
|