Загрузка...
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...
Сохранить в:
| Опубликовано в: : | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Главные авторы: | , |
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Предметы: | |
| Online-ссылка: | https://www.redalyc.org/articulo.oa?id=265219625004 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|