Domain permutation reduction for constraint satisfaction problems
Under an Elsevier user license
open archive
Keywords
Complexity
Constraint satisfaction problem
CSP
NP-completeness
Renamable Horn
Stable marriage
Tractability
Cited by (0)
Copyright © 2008 Elsevier B.V. All rights reserved.