Partition search for non-binary constraint satisfaction (Q2372239)
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: Partition search for non-binary constraint satisfaction |
scientific article; zbMATH DE number 5174404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partition search for non-binary constraint satisfaction |
scientific article; zbMATH DE number 5174404 |
Statements
Partition search for non-binary constraint satisfaction (English)
0 references
25 July 2007
0 references
constraint satisfaction
0 references
non-binary constraints
0 references
hash join
0 references
multijoin
0 references
decision diagram
0 references
BDD
0 references
consistency
0 references
forward checking
0 references
semijoin reduction
0 references
dual search
0 references
partition search
0 references
random problems
0 references
0 references
0 references
0 references
0.7501580119132996
0 references
0.7430126667022705
0 references
0.7350748777389526
0 references
