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...
Salvato in:
| Pubblicato in: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Autori principali: | , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Soggetti: | |
| Accesso online: | https://www.redalyc.org/articulo.oa?id=265219625004 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|