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...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | México |
| Recursos: | Universidad Popular Autónoma del Estado de Puebla |
| Repositorio: | Redalyc-UPAEP |
| OAI Identifier: | oai:redalyc.org:265219625004 |
| Acesso em linha: | https://www.redalyc.org/articulo.oa?id=265219625004 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computación Complexity of instances computational complexity Instances Computational Complexity |
| Resumo: | 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. |
|---|