Parameterized complexity of MaxSat above average (Q392026): Difference between revisions

@@ Property / cites work @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of MaxSat above average
@@ Property / cites work: Parameterized complexity of MaxSat above average / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications
+Normal rank
@@ Property / cites work @@
+Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average
+Normal rank
@@ Property / cites work @@
+Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average
+Normal rank
@@ Property / cites work @@
+On Multiway Cut Parameterized above Lower Bounds
@@ Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
+Normal rank
@@ Property / cites work @@
+Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
+Normal rank
@@ Property / cites work @@
+A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application
+Normal rank
@@ Property / cites work @@
+A probabilistic approach to problems parameterized above or below tight bounds
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms Using Linear Programming
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Parameterizing MAX SNP Problems Above Guaranteed Values
+Normal rank
@@ Property / cites work @@
+Q2904774
@@ Property / cites work: Q2904774 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Flowers and Vertex Cover
@@ Property / cites work: Paths, Flowers and Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank