An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.
Daniel KrálOndrej PangrácPublished in: MFCS (2005)
Keyphrases
- constraint satisfaction problems
- search space
- dynamic programming
- worst case
- objective function
- learning algorithm
- cost function
- np hard
- non binary
- path consistency
- asymptotically optimal
- finding optimal solutions
- constraint solving
- space complexity
- randomly generated
- constraint programming
- np complete
- data structure
- optimal solution