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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for problems with no kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for path and cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing way to parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems as Hard as CNF-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of vertex deletion into perfect graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing kernelization for finding long paths and cycles in restricted graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing of Min Ones Problems: A Dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two edge modification problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of unique coverage and its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank

Revision as of 00:34, 10 July 2024

scientific article
Language Label Description Also known as
English
A completeness theory for polynomial (Turing) kernelization
scientific article

    Statements

    A completeness theory for polynomial (Turing) kernelization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 May 2015
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    Turing kernelization
    0 references
    complexity hierarchies
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers