The complexity and expressive power of valued constraints
This thesis is a detailed examination of the expressive power of valued constraints and related complexity questions. The valued constraint satisfaction problem (VCSP) is a generalisation of the constraint satisfaction problem which allows to describe a variety of combinatorial optimisation problems...
Main Author: | Zivny, Stanislav |
---|---|
Other Authors: | Jeavons, Peter |
Published: |
University of Oxford
2009
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510411 |
Similar Items
-
On the Links between Probabilistic Graphical Models and Submodular Optimisation
by: Karri, Senanayak Sesh Kumar
Published: (2016) -
Analyzing capacitated networks via Boolean-based coherent pseudo-Boolean functions
by: Ali Muhammad Ali Rushdi, et al.
Published: (2021-06-01) -
Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
by: Xiaofei Liu, et al.
Published: (2020-10-01) -
On Independence, Matching, and Homomorphism Complexes
by: Hough, Wesley K.
Published: (2017) -
Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY
by: Tischhauser Elmar
Published: (2011-04-01)