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
Changed an Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Leo van Iersel / rank | |||
| Property / author | |||
| Property / author: Leo van Iersel / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.01.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161806016 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:22, 20 March 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
