Domain permutation reduction for constraint satisfaction problems (Q2389649)
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 5580279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Domain permutation reduction for constraint satisfaction problems |
scientific article; zbMATH DE number 5580279 |
Statements
Domain permutation reduction for constraint satisfaction problems (English)
0 references
17 July 2009
0 references
complexity
0 references
constraint satisfaction problem
0 references
CSP
0 references
NP-completeness
0 references
renamable Horn
0 references
stable marriage
0 references
tractability
0 references
0.8956789
0 references
0 references
0.8567495
0 references
0.85033715
0 references
0.84745675
0 references
