First Page | Document Content | |
---|---|---|
Date: 2014-09-26 08:36:25Computational complexity theory Complexity classes NP-complete problems Operations research Combinatorial optimization Mathematical optimization Knapsack problem Reduction Graph coloring NP-hardness NP Optimization problem | Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger WattenhoferAdd to Reading ListSource URL: disco.ethz.chDownload Document from Source WebsiteFile Size: 294,30 KBShare Document on Facebook |