First Page | Document Content | |
---|---|---|
![]() Date: 2007-09-11 19:54:54Analysis of algorithms NP-complete problems Set cover problem Greedy algorithm Time complexity Algorithm Randomized algorithm Theoretical computer science Mathematics Computational complexity theory | Source URL: theory.stanford.eduDownload Document from Source WebsiteFile Size: 194,21 KBShare Document on Facebook |