All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables (Q3586474)
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: All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables |
scientific article |
Statements
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables (English)
0 references
6 September 2010
0 references
0.9909642934799194
0 references
0.7776179313659668
0 references
0.7766141295433044
0 references
0.7583905458450317
0 references
