The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2010.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2017619848
@@ Property / OpenAlex ID: W2017619848 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5472387
@@ Property / cites work: Q5472387 / rank @@
+Normal rank
@@ Property / cites work @@
+On miniaturized problems in parameterized complexity theory
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / 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 @@
+Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Local search: is brute-force avoidable?
@@ Property / cites work: Local search: is brute-force avoidable? / rank @@
+Normal rank
@@ Property / cites work @@
+On Local Search and Placement of Meters in Networks
+Normal rank
@@ Property / cites work @@
+On the Hardness of Losing Weight
@@ Property / cites work: On the Hardness of Losing Weight / rank @@
+Normal rank
@@ Property / cites work @@
+Searching the \(k\)-change neighborhood for TSP is W[1]-hard
+Normal rank
@@ Property / cites work @@
+Parameterized complexity and local search approaches for the stable marriage problem with ties
+Normal rank
@@ Property / cites work @@
+Stable Assignment with Couples: Parameterized Complexity and Local Search
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / 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 @@
+The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
+Normal rank
@@ Property / cites work @@
+Deciding first-order properties of locally tree-decomposable structures
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank