Complexity of Infinite-Domain Constraint Satisfaction

Complexity of Infinite-Domain Constraint Satisfaction
Author :
Publisher : Cambridge University Press
Total Pages :
Release :
ISBN-10 : 9781009158633
ISBN-13 : 1009158635
Rating : 4/5 (635 Downloads)

Book Synopsis Complexity of Infinite-Domain Constraint Satisfaction by : Manuel Bodirsky

Download or read book Complexity of Infinite-Domain Constraint Satisfaction written by Manuel Bodirsky and published by Cambridge University Press. This book was released on 2021-06-10 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Constraint Satisfaction Problems (CSPs) are natural computational problems that appear in many areas of theoretical computer science. Exploring which CSPs are solvable in polynomial time and which are NP-hard reveals a surprising link with central questions in universal algebra. This monograph presents a self-contained introduction to the universal-algebraic approach to complexity classification, treating both finite and infinite-domain CSPs. It includes the required background from logic and combinatorics, particularly model theory and Ramsey theory, and explains the recently discovered link between Ramsey theory and topological dynamics and its implications for CSPs. The book will be of interest to graduate students and researchers in theoretical computer science and to mathematicians in logic, combinatorics, and dynamics who wish to learn about the applications of their work in complexity theory.


Complexity of Infinite-Domain Constraint Satisfaction Related Books

Complexity of Infinite-Domain Constraint Satisfaction
Language: en
Pages:
Authors: Manuel Bodirsky
Categories: Mathematics
Type: BOOK - Published: 2021-06-10 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

Constraint Satisfaction Problems (CSPs) are natural computational problems that appear in many areas of theoretical computer science. Exploring which CSPs are s
Complexity of Infinite-Domain Constraint Satisfaction
Language: en
Pages: 537
Authors: Manuel Bodirsky
Categories: Computers
Type: BOOK - Published: 2021-06-10 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

Introduces the universal-algebraic approach to classifying the computational complexity of constraint satisfaction problems.
Complexity Classifications of Boolean Constraint Satisfaction Problems
Language: en
Pages: 112
Authors: Nadia Creignou
Categories: Mathematics
Type: BOOK - Published: 2001-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

Presents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach.
Complexity of Constraints
Language: en
Pages: 326
Authors: Nadia Creignou
Categories: Computers
Type: BOOK - Published: 2008-12-23 - Publisher: Springer

DOWNLOAD EBOOK

Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems t
On Infinite-Domain CSPs Parameterized by Solution Cost
Language: en
Pages: 53
Authors: George Osipov
Categories:
Type: BOOK - Published: 2024-04-24 - Publisher: Linköping University Electronic Press

DOWNLOAD EBOOK

In this thesis we study the computational complexity of MinCSP - an optimization version of the Constraint Satisfaction Problem (CSP). The input to a MinCSP is