Complexity Research on B Algorithm

Ai Li Han

doi:10.4028/www.scientific.net/AMM.20-23.173

Paper Titles

Improved Support Vector Machine and its Application
p.147

The Research on Grid Resource Management Based on WSDM
p.155

Parallel Line-Up Competition Algorithm for Continuous Optimization
p.161

Research on Framework of Fourth Party Logistics Information Platform Based on Web Services
p.167

Complexity Research on B Algorithm
p.173

A Method of Web Information Automatic Extraction Based on XML
p.178

Exact Solutions for Coupled mKdV Equations by a New Symbolic Computation Method
p.184

Extension and Unascertained Measure for Evaluation of Information Systems Security
p.190

A Comprehensive Analysis Method Based on Fuzzy Hierarchy for the Safety Assessment of Overhead Traveling Crane
p.196

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 20-23Complexity Research on B Algorithm

Complexity Research on B Algorithm

Abstract:

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).