手机知网 App
24小时专家级知识服务
打 开
数学
A Method of Estimating Computational Complexity Based on Input Conditions for N-vehicle Problem
 
<正>This paper proposes a method of estimating computational complexity of problem through analyzing its input condition for N-vehicle exploration problem.The N-vehicle problem is firstly formulated to determine the optimal replacement in the set of permutations of 1 to N.The complexity of the problem is factorial of N(input scale of problem).To balance accuracy and efficiency of general algorithms,this paper mentions a new systematic algorithm design and discusses correspondence between complexity of problem and its input condition,other than just putting forward a uniform approximation algorithm as usual.This is a new technique for analyzing computation of NP problems.The method of corresponding is then presented.We finally carry out a simulation to verify the advantages of the method:1) to decrease computation in enumeration;2) to efficiently obtain computational complexity for any N-vehicle case;3) to guide an algorithm design for any N-vehicle case according to its complexity estimated by the method.
4 117
手机阅读本文
下载APP 手机查看本文
Acta Mathematicae Applicatae Sinica(English Series)
2010年01期

搜 索