The Complexity of Valued Constraint Satisfaction Problems - Softcover
Book 28 of 43: Cognitive Technologies
About the Author
Dr. Stanislav Živný has a Ph.D. in Computer Science from the University of Oxford, and he was a Junior Research Fellow in Mathematical and Physical Sciences at Oxford's University College. The doctoral thesis won the 2011 ACP (Association for Constraint Programming) Doctoral Award for the best thesis in the area of constraint programming from the previous two years. He was awarded a Senior Research Fellowship in Advances in Discrete Mathematics and its Applications, hosted by the University of Warwick, which commenced in autumn 2012.
Review
From the reviews:
“The book is concerned with valued constraint satisfaction problems with finite domains, i. e., the problem of minimising the sum of functions that each depend on some subset of a finite set of discrete variables with finite domains. ... In all places the description is very precise and exact, detailed where needed. This makes it a very useful reference for researchers working in the field.” (Thomas Jansen, zbMATH, Vol. 1283, 2014)
"About this title" may belong to another edition of this title.
