Back to Results
First PageMeta Content
Computational complexity theory / Operations research / Theory of computation / Mathematics / Knapsack problem / Optimization problem / NP / Mathematical optimization / Polynomial-time approximation scheme / Dynamic programming / Time complexity / Isolation lemma


CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete
Add to Reading List

Document Date: 2014-11-14 09:53:16

Open Document

File Size: 91,69 KB

Share Result on Facebook