Lanean...
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...
Gorde:
| Argitaratua izan da: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Egile Nagusiak: | , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Gaiak: | |
| Sarrera elektronikoa: | https://www.redalyc.org/articulo.oa?id=265219625004 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|