Parameterized Complexity and Subexponential-Time Computability (Q2908538): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-30891-8_11
+Normal rank
@@ Property / OpenAlex ID @@
+W200564616
@@ Property / OpenAlex ID: W200564616 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved deterministic local search algorithm for 3-SAT
+Normal rank
@@ Property / cites work @@
+On the Amount of Nondeterminism and the Power of Verifying
+Normal rank
@@ Property / cites work @@
+Circuit Bottom Fan-in and Computational Power
@@ Property / cites work: Circuit Bottom Fan-in and Computational Power / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of polynomial-time approximation
@@ Property / cites work: The complexity of polynomial-time approximation / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Characterizing parallel hierarchies by reducibilities
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Improved deterministic algorithms for weighted matching and packing problems
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes and parameterized complexity
+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 @@
+Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
+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 @@
+Genetic Design of Drugs Without Side-Effects
@@ Property / cites work: Genetic Design of Drugs Without Side-Effects / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396009
@@ Property / cites work: Q3396009 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+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 @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3740256
@@ Property / cites work: Q3740256 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / 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 maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ Property / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank