Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables |
scientific article; zbMATH DE number 6033485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables |
scientific article; zbMATH DE number 6033485 |
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
0 references
0.9909642934799194
0 references
0.7789189219474792
0 references
0.7786128520965576
0 references
0.7590083479881287
0 references
