The tractability of CSP classes defined by forbidden patterns (Q3143567)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6111830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The tractability of CSP classes defined by forbidden patterns |
scientific article; zbMATH DE number 6111830 |
Statements
The Tractability of CSP Classes Defined by Forbidden Patterns (English)
0 references
3 December 2012
0 references
constraint pattern
0 references
constraint satisfaction
0 references
CSP
0 references
tractability
0 references
forbidden pattern
0 references
computational complexity
0 references
0.9098803400993348
0 references
0.8576968908309937
0 references
0.8329524993896484
0 references
0.831742525100708
0 references
