Complexity Analysis of Heuristic CSP Search Algorithms

2006 ◽  
pp. 88-99 ◽  
Author(s):  
Igor Razgon
Keyword(s):  
Complexity Analysis ◽  
Search Algorithms

Complexity Research on B Algorithm

2010 ◽  
Vol 20-23 ◽  
pp. 173-177
Author(s):  
Ai Li Han
Keyword(s):  
Time Complexity ◽  
Complexity Analysis ◽  
Search Algorithms ◽  
Heuristic Function ◽  
Worst Case ◽  
Intelligent Search ◽  
The Cost

The time complexity of B algorithm, one of the intelligent search algorithms, is discussed. By anatomizing some instances, it is pointed out that the cost of calculating the value of heuristic function should be included in the range of time complexity analysis for B algorithm. And then, an algorithm of calculating the value of heuristic function is presented. By analyzing the cost of calculating the value of heuristic function, it is pointed out that the number of recursions in B algorithm is O(n!) in the worst case. Therefore, the time complexity of B algorithm is exponential instead of O(n2).

The Local Search Algorithms for Maximum 3-Satisfiablility Problem

2010 ◽  
Vol 33 (7) ◽  
pp. 1127-1139
Author(s):  
Da-Ming ZHU ◽  
Shao-Han MA ◽  
Ping-Ping ZHANG
Keyword(s):  
Local Search ◽  
Search Algorithms ◽  
Local Search Algorithms
Sign in / Sign up

Export Citation Format

Share Document