Strong computational lower bounds via parameterized complexity (Q856413): Difference between revisions

@@ Property / author @@
-Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
-Normal rank
@@ Property / author @@
+Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
+Normal rank
@@ 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.jcss.2006.04.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2130190334
@@ Property / OpenAlex ID: W2130190334 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q55891718
@@ Property / Wikidata QID: Q55891718 / 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 @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252376
@@ Property / cites work: Q4252376 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving large FPT problems on coarse-grained parallel machines
+Normal rank
@@ Property / cites work @@
+Characterizing parallel hierarchies by reducibilities
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737204
@@ Property / cites work: Q4737204 / rank @@
+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 @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4259986
@@ Property / cites work: Q4259986 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251072
@@ Property / cites work: Q4251072 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+On limited nondeterminism and the complexity of the V-C dimension
+Normal rank
@@ Property / cites work @@
+On the complexity of database queries
@@ Property / cites work: On the complexity of database queries / 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 a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank