A completeness theory for polynomial (Turing) kernelization (Q2343083): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-014-9910-8
@@ Property / DOI: 10.1007/s00453-014-9910-8 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-014-9910-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2008912593
@@ Property / OpenAlex ID: W2008912593 / 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 @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel(s) for problems with no kernel
@@ Property / cites work: Kernel(s) for problems with no kernel / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel bounds for path and cycle problems
@@ Property / cites work: Kernel bounds for path and cycle problems / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel bounds for disjoint cycles and disjoint paths
+Normal rank
@@ Property / cites work @@
+Nondeterminism within $P^ *  $
@@ Property / cites work: Nondeterminism within $P^ * $ / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+The Turing way to parameterized complexity
@@ Property / cites work: The Turing way to parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems as Hard as CNF-SAT
@@ Property / cites work: On Problems as Hard as CNF-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743378
@@ Property / cites work: Q5743378 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex deletion into perfect graph classes
+Normal rank
@@ Property / cites work @@
+Q5743381
@@ Property / cites work: Q5743381 / rank @@
+Normal rank
@@ Property / cites work @@
+Turing kernelization for finding long paths and cycles in restricted graph classes
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743382
@@ Property / cites work: Q5743382 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
+Normal rank
@@ Property / cites work @@
+Preprocessing of Min Ones Problems: A Dichotomy
@@ Property / cites work: Preprocessing of Min Ones Problems: A Dichotomy / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743380
@@ Property / cites work: Q5743380 / rank @@
+Normal rank
@@ Property / cites work @@
+Two edge modification problems without polynomial kernels
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of unique coverage and its variants
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank
@@ Property / cites work @@
+Some consequences of non-uniform conditions on uniform classes
+Normal rank
@@ Property / DOI @@
+.1007/S00453-014-9910-8
@@ Property / DOI: 10.1007/S00453-014-9910-8 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2343083