Živný, Stanislav
The Complexity of Valued Constraint Satisfaction Problems
Table of contents
1. Background
Stanislav Živný
2. Expressibility of Valued Constraints
Stanislav Živný
3. Expressibility of Fixed-Arity Languages
Stanislav Živný
4. Expressibility of Submodular Languages
Stanislav Živný
5. Non-expressibility of Submodular Languages
Stanislav Živný
6. Tractable Languages
Stanislav Živný
7. Conservative Languages
Stanislav Živný
8. The Power of Linear Programming
Stanislav Živný
9. Hybrid Tractability
Stanislav Živný
10. Summary and Open Problems
Stanislav Živný
Nyckelord: Computer Science, Theory of Computation, Artificial Intelligence (incl. Robotics), Mathematical Logic and Foundations, Mathematics of Computing
- Författare
- Živný, Stanislav
- Utgivare
- Springer
- Utgivningsår
- 2012
- Språk
- en
- Utgåva
- 2012
- Serie
- Cognitive Technologies
- Sidantal
- 17 sidor
- Kategori
- Datateknik, Datakommunikation
- Format
- E-bok
- eISBN (PDF)
- 9783642339745
