scholarly journals Complexity Analysis of Quantum Walk Based Search Algorithms

2013 ◽  
Vol 10 (7) ◽  
pp. 1601-1605 ◽  
Author(s):  
B. L. Douglas ◽  
J. B. Wang
Keyword(s):  
Complexity Analysis ◽  
Quantum Walk ◽  
Search Algorithms

scholarly journals Quantum-walk-based search algorithms with multiple marked vertices

2021 ◽  
Vol 103 (6) ◽  
Author(s):  
G. A. Bezerra ◽  
P. H. G. Lugão ◽  
R. Portugal
Keyword(s):  
Quantum Walk ◽  
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).

Sign in / Sign up

Export Citation Format

Share Document