Polynomially bounded minimization problems which are hard to approximate (Q4630248): Difference between revisions

@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating the independent set problem
+Normal rank
@@ Property / cites work @@
+Completeness in approximation classes
@@ Property / cites work: Completeness in approximation classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum maximal independence number
+Normal rank
@@ Property / cites work @@
+Robust trainability of single neurons
@@ Property / cites work: Robust trainability of single neurons / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+On approximating the minimum independent dominating set
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum common subgraph problem
+Normal rank
@@ Property / cites work @@
+Logical definability of NP optimization problems
@@ Property / cites work: Logical definability of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Relations Among Complexity Measures
@@ Property / cites work: Relations Among Complexity Measures / rank @@
+Normal rank