An Overview of the Theory of Instances Computational Complexity

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

Full description

Saved in:
Bibliographic Details
Published in:International Journal of Combinatorial Optimization Problems and Informatics Vol. 2; no. 2; pp. 21 - 27
Main Authors: Ruiz-Vanoye, Jorge A, Diaz-Parra, Ocotlan
Format: Journal Article
Language:English
Published: Jiutepec International Journal of Combinatorial Optimization Problems & Informatics 01.05.2011
Subjects:
Algorithms
Classification
Combinatorial analysis
Complexity
Computation
Optimization
Organizations
ISSN:2007-1558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2007-1558