Limit search to available items
Book Cover
Author Živný, Stanislav

Title The Complexity of Valued Constraint Satisfaction Problems
Published Dordrecht : Springer, 2012


Description 1 online resource (175 pages)
Series Cognitive Technologies
Cognitive technologies.
Contents Background -- Expressive power -- Expressibility of valued constraints -- Expressibility of fixed-Arity languages -- Expressibility of submodular languages -- Non-expressibility of submodular languages -- Tractability -- Tractable languages -- Conservative languages -- The power of linear programming -- Hybrid tractability -- Summary and open problems
Summary 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 discrete mathematics, computer science and artificial intelligence under different names: Min-Sum problems, MAP inference in Markov random fields (MRFs) and conditional random fields (CRFs), Gibbs energy minimisation, valued constraint satisfaction problems (VCSPs), and, for two-state variabl
Bibliography Includes bibliographical references and index
Notes Print version record
Subject Computer science -- Mathematics.
Constraints (Artificial intelligence) -- Mathematics
Computational complexity.
COMPUTERS -- Computer Literacy.
COMPUTERS -- Computer Science.
COMPUTERS -- Data Processing.
COMPUTERS -- Hardware -- General.
COMPUTERS -- Information Technology.
COMPUTERS -- Machine Theory.
COMPUTERS -- Reference.
Computational complexity.
Computer science -- Mathematics.
Genre/Form Electronic books
Form Electronic book
ISBN 9783642339745