amethodofestimatingcomputationalcomplexitybasedoninputconditionsfornvehicleproblem

CSpace > 应用数学研究所

	amethodofestimatingcomputationalcomplexitybasedoninputconditionsfornvehicleproblem
	Xi Xia; Cui Jinchuan
	2010
发表期刊	actamathematicaeapplicataesinica
ISSN	0168-9673
卷号	000 期号:001 页码:1
摘要	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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/47373
专题	应用数学研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Xi Xia,Cui Jinchuan. amethodofestimatingcomputationalcomplexitybasedoninputconditionsfornvehicleproblem[J]. actamathematicaeapplicataesinica,2010,000(001):1.
APA	Xi Xia,&Cui Jinchuan.(2010).amethodofestimatingcomputationalcomplexitybasedoninputconditionsfornvehicleproblem.actamathematicaeapplicataesinica,000(001),1.
MLA	Xi Xia,et al."amethodofestimatingcomputationalcomplexitybasedoninputconditionsfornvehicleproblem".actamathematicaeapplicataesinica 000.001(2010):1.