Implementing a test for tractability
The question of determining which sets of constraints give rise to NP-complete problems, and which give rise to tractable problems, is an important open problem in the theory of constraint satisfaction. It has been shown in previous papers that certain sufficient conditions for tractability and NP-c...
Main Authors: | Gault, R, Jeavons, P |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2004
|
Similar Items
-
Implementing a test for tractability
by: Gault, R, et al.
Published: (2004) -
A Test for Tractability
by: P.G.Jeavons, et al.
Published: (1996) -
New tractable classes from old
by: Cohen, D, et al.
Published: (2003) -
New Tractable Classes From Old
by: Cohen, D, et al.
Published: (2003) -
The order encoding: From tractable CSP to tractable SAT
by: Petke, J, et al.
Published: (2011)