<--- Back to Details
| 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 |
Add to Reading List |
Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer | On Basing One-Way Functions on NP-Hardness Adi Akavia Oded Goldreich MITDocID: 1unrQ - View Document |
| Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger WattenhoferDocID: 1rrUb - View Document |
 | Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014DocID: 1rdLy - View Document |
 | On the Hardness of Being Truthful Christos Papadimitriou Michael SchapiraDocID: 1q81r - View Document |
 | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1DocID: 1q2Qr - View Document |