Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5417644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / 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 Disjoint Cycles and Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Étude des coefficients de Fourier des fonctions de \(L^ p(G)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the directed feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Betweenness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Max Lin-2 above average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic ordering is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Betweenness Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Ordering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Sobolev Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover problem parameterized above and below tight bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betweenness parameterized above tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Approach to Problems Parameterized above or below Tight Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arrangement problem parameterized above guaranteed value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of minimum profile problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to cyclic ordering of 2D orientations using ternary relation algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank
 
Normal rank

Latest revision as of 04:15, 5 July 2024

scientific article
Language Label Description Also known as
English
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
scientific article

    Statements

    Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    constraint satisfaction
    0 references
    permutation
    0 references
    parameterized complexity
    0 references
    kernels
    0 references
    probabilistic method
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers