Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2015.08.029
+Normal rank
@@ Property / OpenAlex ID @@
+W2158951688
@@ Property / OpenAlex ID: W2158951688 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+An improved deterministic local search algorithm for 3-SAT
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity and Subexponential-Time Computability
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+On parameterized exponential time complexity
@@ Property / cites work: On parameterized exponential time complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On miniaturized problems in parameterized complexity theory
+Normal rank
@@ Property / cites work @@
+Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping
+Normal rank
@@ Property / cites work @@
+An Isomorphism Between Subexponential and Parameterized Complexity Theory
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+edge dominating set: Efficient Enumeration-Based Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental List Coloring of Graphs, Parameterized by Conservation
+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 @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q5417690
@@ Property / cites work: Q5417690 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Variable-Weighted 2-SAT and Dual Problems
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
+Normal rank