![Mathematical optimization / Linear programming / Computational complexity theory / Combinatorial optimization / Operations research / Semidefinite programming / Linear programming relaxation / Relaxation / Constraint satisfaction problem / Theoretical computer science / Mathematics / Applied mathematics Mathematical optimization / Linear programming / Computational complexity theory / Combinatorial optimization / Operations research / Semidefinite programming / Linear programming relaxation / Relaxation / Constraint satisfaction problem / Theoretical computer science / Mathematics / Applied mathematics](https://www.pdfsearch.io/img/b38d0620de6c98f1571f5fb81eca6cb3.jpg) Date: 2009-10-30 11:58:51Mathematical optimization Linear programming Computational complexity theory Combinatorial optimization Operations research Semidefinite programming Linear programming relaxation Relaxation Constraint satisfaction problem Theoretical computer science Mathematics Applied mathematics | | Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra A dissertation submitted in partial fulfillmentAdd to Reading ListSource URL: www.eecs.berkeley.eduDownload Document from Source Website File Size: 2,41 MBShare Document on Facebook
|