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...
Uloženo v:
| Vydáno v: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Témata: | |
| On-line přístup: | https://www.redalyc.org/articulo.oa?id=265219625004 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|