<--- Back to Details
First PageDocument Content
Analysis of algorithms / NP-complete problems / Set cover problem / Greedy algorithm / Time complexity / Algorithm / Randomized algorithm / Theoretical computer science / Mathematics / Computational complexity theory
Date: 2007-09-11 19:54:54
Analysis of algorithms
NP-complete problems
Set cover problem
Greedy algorithm
Time complexity
Algorithm
Randomized algorithm
Theoretical computer science
Mathematics
Computational complexity theory

Add to Reading List

Source URL: theory.stanford.edu

Download Document from Source Website

File Size: 194,21 KB

Share Document on Facebook

Similar Documents