Differential approximation for optimal satisfiability and related problems (Q1869721): Difference between revisions

@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+Q4375777
@@ Property / cites work: Q4375777 / rank @@
+Normal rank
@@ Property / cites work @@
+On an approximation measure founded on the links between optimization and polynomial approximation theory
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Resolution vs. cutting plane solution of inference problems: Some computational experience
+Normal rank
@@ Property / cites work @@
+Computational experience with an interior point algorithm on the satisfiability problem
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q4250183
@@ Property / cites work: Q4250183 / rank @@
+Normal rank