A new upper bound for $( n , 3)$-MAX-SAT (Q1946835): Difference between revisions

@@ Property / cites work @@
+Q3044338
@@ Property / cites work: Q3044338 / rank @@
+Normal rank
@@ Property / cites work @@
+-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
+Normal rank
@@ Property / cites work @@
+A full derandomization of schöning's k-SAT algorithm
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete MAXSAT problem
@@ Property / cites work: A simplified NP-complete MAXSAT problem / rank @@
+Normal rank
@@ Property / cites work @@
+A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
+Normal rank
@@ Property / cites work @@
+Guided Search and a Faster Deterministic Algorithm for 3-SAT
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank
@@ Property / cites work @@
+New Bounds for MAX-SAT by Clause Learning
@@ Property / cites work: New Bounds for MAX-SAT by Clause Learning / rank @@
+Normal rank
@@ Property / cites work @@
+MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank

A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835): Difference between revisions

Latest revision as of 08:02, 6 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)