MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907): Difference between revisions

@@ Property / cites work @@
+Q4952605
@@ Property / cites work: Q4952605 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4511230
@@ Property / cites work: Q4511230 / rank @@
+Normal rank
@@ Property / cites work @@
+A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
+Normal rank
@@ Property / cites work @@
+Q3931248
@@ Property / cites work: Q3931248 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754147
@@ Property / cites work: Q2754147 / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / rank @@
+Normal rank
@@ Property / cites work @@
+New worst-case upper bounds for SAT
@@ Property / cites work: New worst-case upper bounds for SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Solving satisfiability in less than \(2^ n\) steps
+Normal rank
@@ Property / cites work @@
+Q4938646
@@ Property / cites work: Q4938646 / rank @@
+Normal rank