Lower bounds for kernelizations and other preprocessing procedures (Q538466): 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.1007/s00224-010-9270-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2051784313
@@ Property / OpenAlex ID: W2051784313 / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems without Polynomial Kernels (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+On computing Boolean connectives of characteristic functions
+Normal rank
@@ Property / cites work @@
+Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549693
@@ Property / cites work: Q3549693 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of first-order and monadic second-order logic revisited
+Normal rank
@@ Property / cites work @@
+SAT-Problems and Reductions with Respect to the Number of  Variables
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Some consequences of non-uniform conditions on uniform classes
+Normal rank