Tractability in constraint satisfaction problems: a survey (Q271997)
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: Tractability in constraint satisfaction problems: a survey |
scientific article; zbMATH DE number 6570964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tractability in constraint satisfaction problems: a survey |
scientific article; zbMATH DE number 6570964 |
Statements
Tractability in constraint satisfaction problems: a survey (English)
0 references
20 April 2016
0 references
computational complexity
0 references
polynomial-time
0 references
dichotomy
0 references
tractable language
0 references
polymorphism
0 references
microstructure
0 references
forbidden pattern
0 references
relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8656333684921265
0 references
0.859043538570404
0 references
0.8532170653343201
0 references
0.8480744361877441
0 references
0.8438428044319153
0 references
