Yüklüyor......
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...
Kaydedildi:
Yayımlandı: | International Journal of Combinatorial Optimization Problems and Informatics |
---|---|
Asıl Yazarlar: | , |
Materyal Türü: | Artigo |
Dil: | Inglês |
Baskı/Yayın Bilgisi: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
Konular: | |
Online Erişim: | https://www.redalyc.org/articulo.oa?id=265219625004 |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|