Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete.
Jaroslav NesetrilMark H. SiggersPublished in: MFCS (2007)
Keyphrases
- constraint satisfaction problems
- np complete
- constraint satisfaction
- np hard
- constraint programming
- constraint propagation
- satisfiability problem
- non binary
- combinatorial problems
- randomly generated
- computational complexity
- constraint solving
- arc consistency
- conjunctive queries
- theorem proving
- global constraints
- theorem prover
- bounded treewidth
- constraint problems
- np complete problems
- constraint networks
- decomposition methods
- data complexity
- decision procedures
- soft constraints
- constraint solver
- sat problem
- backtracking search
- graph coloring problems