期刊名称：International Journal of Combinatorial Optimization Problems and Informatics
印刷版ISSN：2007-1558
电子版ISSN：2007-1558
出版年度：2011
卷号：2
期号：2
页码：21-27
语种：English
出版社：International Journal of Combinatorial Optimization Problems and Informatics
其他摘要：The theory of the computational complexity is a subject of international interest of scientific, technological and enterprise organizations. The computational complexity contains diverse elements such as the classes of problems complexity (P, NP, NP-hard and NP-complete, and others), complexity of algorithms (it is a way to classify how efficient is an algorithm by means the execution time to solve a problem with the worst-case input), complexity of instances (it is computational complexity measures to determine the complex of the problems instances), and others elements. This work is focused on presenting a review of the theory of instances computational complexity.
关键词：Instances Computational Complexity; Complexity of instances; computational complexity
其他关键词：Instances Computational Complexity; Complexity of instances; computational complexity.
