Strong partial clones and the complexity of constraint satisfaction problems : limitations and applications /
Збережено в:
| Автор: | |
|---|---|
| Формат: | Електронний ресурс eКнига |
| Мова: | Англійська |
| Опубліковано: |
Linkoping, Sweden :
Department of Computer and Information Science, Division for Software and Systems,
2016.
|
| Серія: | Linkoping studies in science and technology. Dissertations ;
Number 1733. |
| Предмети: | |
| Онлайн доступ: | Click to View |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Схожі ресурси: Strong partial clones and the complexity of constraint satisfaction problems :
- Ant colony optimization and constraint programming
- Constraint satisfaction problems CSP formalisms and techniques /
- A class of algorithms for distributed constraint optimization
- Android Application Development for the Intel® Platform
- Scala for Java developers : build reactive, scalable applications and integrate Java code with the power of Scala /
- TouchDevelop: Programming on the Go