Lataa...
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...
Tallennettuna:
| Julkaisussa: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Päätekijät: | , |
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Aiheet: | |
| Linkit: | https://www.redalyc.org/articulo.oa?id=265219625004 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|