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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Journal of Combinatorial Optimization Problems and Informatics Jg. 2; H. 2; S. 21 - 27
Hauptverfasser: Ruiz-Vanoye, Jorge A, Diaz-Parra, Ocotlan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Jiutepec International Journal of Combinatorial Optimization Problems & Informatics 01.05.2011
Schlagworte:
Algorithms
Classification
Combinatorial analysis
Complexity
Computation
Optimization
Organizations
ISSN:2007-1558
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2007-1558