A Theoretical Analysis of the Average-Time Complexity of Domain-Heuristics for Arc-Consistency Algorithms.
Marc R. C. van DongenPublished in: JFPLC (2001)
Keyphrases
- theoretical analysis
- space complexity
- arc consistency
- computational complexity
- worst case
- constraint satisfaction problems
- domain independent
- constraint programming
- max csp
- search algorithm
- constraint networks
- arc consistency algorithm
- singleton arc consistency
- combinatorial optimization
- search methods
- search strategies
- soft constraints
- hard problems
- forward checking
- optimal worst case time complexity