Back to Results
First PageMeta Content
Computational complexity theory / Theory of computation / Operations research / Complexity classes / Combinatorial optimization / Analysis of algorithms / Knapsack problem / Simplex algorithm / Time complexity / Optimization problem / NP / Polynomial-time approximation scheme


CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014
Add to Reading List

Document Date: 2014-12-24 22:57:16

Open Document

File Size: 184,31 KB

Share Result on Facebook