|
|
|
|
|
 |
Mathematical optimization:
|  |
|
| The Complexity of Valued Constraint Satisfaction Problems |
| Author |
Stanislav Živný |
|
|
| Publisher |
Springer-Verlag Berlin Heidelberg |
Publish Date |
2012 |
| Publish Time |
|
Pages Number |
170 |
| Cost |
|
Poster |
admin |
| Cover type |
|
Size |
|
| DOI Code |
|
Dewey Code |
|
| LC Code |
|
File |
- |
|
|
|
Description
|
|
The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different contexts of computer science and artificial intelligence under different names: Min-Sum Problems, inference in Markov Random Fields (MRFs) and Conditional Random Fields (CRFs), Gibbs energy minimisation, valued constraint satisfaction problems (VCSPs), and (for twostate variables) pseudo-Boolean optimisation. We present general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem.
|
|
Average: 4.5
Rate numbers: 4
Rate the book
|
|
|
Back to book treasure homepage | Back to selected book topic
|
|
|
|
|
|
|
|
|
|
