Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard (Q5958710)
From MaRDI portal
scientific article; zbMATH DE number 1715755
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard |
scientific article; zbMATH DE number 1715755 |
Statements
Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard (English)
0 references
3 March 2002
0 references
constraint satisfaction
0 references
backtracking
0 references
backjumping
0 references
conflict-directed backjumping
0 references
forward checking
0 references
maintaining arc consistency
0 references
