The complexity and expressive power of valued constraints

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...

Full description

Bibliographic Details
Main Author: Zivny, Stanislav
Other Authors: Jeavons, Peter
Published: University of Oxford 2009
Subjects:
519
Computer science (mathematics) : Discrete mathematics (statistics) : Applications and algorithms : complexity : expressive power : min-cut : pseudo-Boolean optimisation : submodularity : valued constraints
Online Access:http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510411

Internet

http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510411

Similar Items