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
Removed claim: author (P16): Item:Q295643 |
Changed an Item |
||
| Property / author | |||
| Property / author: Leo van Iersel / rank | |||
Normal rank | |||
Revision as of 14:29, 12 February 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
11 May 2012
0 references
constraint satisfaction
0 references
permutation
0 references
parameterized complexity
0 references
kernels
0 references
probabilistic method
0 references
