The Resource The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book)
The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book)
Resource Information
The item The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Sydney Jones Library, University of Liverpool.This item is available to borrow from 1 library branch.
Resource Information
The item The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Sydney Jones Library, University of Liverpool.
This item is available to borrow from 1 library branch.
- 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 variables, pseudo-Boolean optimisation. In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques. The book is suitable for researchers interested in methods and results from the area of constraint programming and discrete optimisation
- Language
- eng
- Extent
- 1 online resource (xvii, 170 p.)
- Contents
-
- Chap. 1
- Introduction
- Chap. 2
- Background
- Chap. 3
- Expressibility of Valued Constraints
- Chap. 4
- Expressibility of Fixed-Arity Languages
- Chap. 5
- Expressibility of Submodular Languages
- Chap. 6
- Non-expressibility of Submodular Languages
- Chap. 7
- Tractable Languages
- Chap. 8
- Conservative Languages
- Chap. 9
- The Power of Linear Programming
- Chap. 10
- Hybrid Tractability
- Chap. 11
- Summary and Open Problems
- References
- Index
- Isbn
- 9783642339738
- Label
- The complexity of valued constraint satisfaction problems
- Title
- The complexity of valued constraint satisfaction problems
- Statement of responsibility
- Stanislav Živný
- Subject
-
- COMPUTERS / Computer Science
- COMPUTERS / Data Processing
- COMPUTERS / Hardware / General
- COMPUTERS / Information Technology
- COMPUTERS / Machine Theory
- COMPUTERS / Reference
- Computational complexity
- Computer science -- Mathematics
- Constraints (Artificial intelligence) -- Mathematics
- COMPUTERS / Computer Literacy
- Language
- eng
- 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 variables, pseudo-Boolean optimisation. In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques. The book is suitable for researchers interested in methods and results from the area of constraint programming and discrete optimisation
- Cataloging source
- YDXCP
- http://library.link/vocab/creatorName
- Živný, Stanislav
- Dewey number
- 004.0151
- Index
- index present
- LC call number
- QA76.9.M35
- LC item number
- Z58 2012
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- Series statement
- Cognitive technologies
- http://library.link/vocab/subjectName
-
- Computer science
- Constraints (Artificial intelligence)
- Computational complexity
- COMPUTERS / Computer Literacy
- COMPUTERS / Computer Science
- COMPUTERS / Data Processing
- COMPUTERS / Hardware / General
- COMPUTERS / Information Technology
- COMPUTERS / Machine Theory
- COMPUTERS / Reference
- Label
- The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book)
- Bibliography note
- Includes bibliographical references and index
- Contents
- Chap. 1 -- Introduction -- Chap. 2 -- Background -- Chap. 3 -- Expressibility of Valued Constraints -- Chap. 4 -- Expressibility of Fixed-Arity Languages -- Chap. 5 -- Expressibility of Submodular Languages -- Chap. 6 -- Non-expressibility of Submodular Languages -- Chap. 7 -- Tractable Languages -- Chap. 8 -- Conservative Languages -- Chap. 9 -- The Power of Linear Programming -- Chap. 10 -- Hybrid Tractability -- Chap. 11 -- Summary and Open Problems -- References -- Index
- Control code
- SPR818413991
- Dimensions
- unknown
- Extent
- 1 online resource (xvii, 170 p.)
- Form of item
- online
- Isbn
- 9783642339738
- Specific material designation
- remote
- Label
- The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book)
- Bibliography note
- Includes bibliographical references and index
- Contents
- Chap. 1 -- Introduction -- Chap. 2 -- Background -- Chap. 3 -- Expressibility of Valued Constraints -- Chap. 4 -- Expressibility of Fixed-Arity Languages -- Chap. 5 -- Expressibility of Submodular Languages -- Chap. 6 -- Non-expressibility of Submodular Languages -- Chap. 7 -- Tractable Languages -- Chap. 8 -- Conservative Languages -- Chap. 9 -- The Power of Linear Programming -- Chap. 10 -- Hybrid Tractability -- Chap. 11 -- Summary and Open Problems -- References -- Index
- Control code
- SPR818413991
- Dimensions
- unknown
- Extent
- 1 online resource (xvii, 170 p.)
- Form of item
- online
- Isbn
- 9783642339738
- Specific material designation
- remote
Subject
- COMPUTERS / Computer Science
- COMPUTERS / Data Processing
- COMPUTERS / Hardware / General
- COMPUTERS / Information Technology
- COMPUTERS / Machine Theory
- COMPUTERS / Reference
- Computational complexity
- Computer science -- Mathematics
- Constraints (Artificial intelligence) -- Mathematics
- COMPUTERS / Computer Literacy
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/The-complexity-of-valued-constraint-satisfaction/VysCQKBCuOg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/The-complexity-of-valued-constraint-satisfaction/VysCQKBCuOg/">The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">Sydney Jones Library, University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/The-complexity-of-valued-constraint-satisfaction/VysCQKBCuOg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/The-complexity-of-valued-constraint-satisfaction/VysCQKBCuOg/">The complexity of valued constraint satisfaction problems, Stanislav Živný, (electronic book)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">Sydney Jones Library, University of Liverpool</a></span></span></span></span></div>
