Complexity of Infinite-Domain Constraint Satisfaction Image close
Complexity of Infinite-Domain Constraint Satisfaction on Hardback by Manuel Bodirsky
Complexity of Infinite-Domain Constraint Satisfaction on Hardback by Manuel Bodirsky
Show Hide Adult Content
Complexity of Infinite-Domain Constraint Satisfaction close

Non-Fiction Books:

Home  
Books  
Non-Fiction  
Maths & Science  
Mathematics  
Mathematical foundations  
Mathematical logic

Complexity of Infinite-Domain Constraint Satisfaction

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Hardback
$358.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley

Buy Now, Pay Later with:

4 payments of $89.75 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 18-28 June using International Courier

Explore more Lecture Notes in Logic

See all products in this series

Logic Colloquium 2005 on Hardback by Ludomir Newelski
$305.99
Logic Colloquium 2005
by Ludomir Newelski ~ Hardback
Available - Usually ships in 3-4 weeks
Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond: Volume 1, Ordered Graphs and Distanced Graphs on Hardback by Gregory Cherlin
$320.99
Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and...
by Gregory Cherlin ~ Hardback
Available - Usually ships in 3-4 weeks
Quantifiers, Propositions and Identity on Hardback by Robert Goldblatt
$306.99
Quantifiers, Propositions and Identity
by Robert Goldblatt ~ Hardback
Available - Usually ships in 3-4 weeks
Logic Colloquium 2007 on Hardback
$295.99
Logic Colloquium 2007
Hardback
Available - Usually ships in 3-4 weeks
Stable Domination and Independence in Algebraically Closed Valued Fields by Deirdre Haskell
$111.99
Stable Domination and Independence in Algebraically Closed Valued...
by Deirdre Haskell ~ Paperback / softback
Available - Usually ships in 3-4 weeks
The Core Model Iterability Problem by John Steel Save $51
$135.99
$187.95
The Core Model Iterability Problem
by John Steel ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Kurt Gödel
$114.99
Kurt Gödel
Paperback / softback
Available - Usually ships in 3-4 weeks
Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond: Volume 2, 3-Multi-graphs and 2-Multi-tournaments on Hardback by Gregory Cherlin
$285.99
Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and...
by Gregory Cherlin ~ Hardback
Available - Usually ships in 3-4 weeks
A General Algebraic Semantics for Sentential Logics on Hardback by Josep Maria Font
$304.99
A General Algebraic Semantics for Sentential Logics
by Josep Maria Font ~ Hardback
Available - Usually ships in 3-4 weeks
Logic Colloquium '90 on Hardback
$295.99
Logic Colloquium '90
Hardback
Available - Usually ships in 3-4 weeks
Logic Colloquium '96 on Hardback
$293.99
Logic Colloquium '96
Hardback
Available - Usually ships in 3-4 weeks
Descriptive Set Theory and Forcing by Arnold Miller Save $51
$135.99
$187.95
Descriptive Set Theory and Forcing
by Arnold Miller ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Descriptive Set Theory and Forcing on Hardback by Arnold W Miller
$304.99
Descriptive Set Theory and Forcing
by Arnold W Miller ~ Hardback
Available - Usually ships in 3-4 weeks
Bounded Variable Logics and Counting on Hardback by Martin Otto
$304.99
Bounded Variable Logics and Counting
by Martin Otto ~ Hardback
Available - Usually ships in 3-4 weeks
Logic Colloquium '95 on Hardback
$345.99
Logic Colloquium '95
Hardback
Available - Usually ships in 3-4 weeks
Games, Scales and Suslin Cardinals on Hardback
$299.99
Games, Scales and Suslin Cardinals
Hardback
Available - Usually ships in 3-4 weeks

Description

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.

Author Biography:

Manuel Bodirsky is Professor at the Institute for Algebra in the Faculty of Mathematics at TU Dresden.
Release date Australia
June 10th, 2021
Audience
  • Professional & Vocational
Pages
300
Dimensions
158x235x34
ISBN-13
9781107042841
Product ID
34661424

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Non-Fiction >
Maths & Science >
Mathematics >
Mathematical foundations >
Mathematical logic
Books >
Non-Fiction >
Maths & Science >
Mathematics >
Combinatorics & graph theory
Books >
Computers & Internet >
Computer science >
Mathematical theory of computation
Books >
Computers & Internet >
Computer science >
Artificial intelligence