- 538 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
Complexity of Infinite-Domain Constraint Satisfaction
About this book
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.
Trusted by 375,005 students
Access to over 1.5 million titles for a fair monthly price.
Study more efficiently using our study tools.
Information
Table of contents
- Cover
- Half-title
- Series information
- Title page
- Copyright information
- CONTENTS
- ACKNOWLEDGEMENTS
- Chapter 1 INTRODUCTION TO CONSTRAINT SATISFACTION PROBLEMS
- Chapter 2 MODEL THEORY
- Chapter 3 PRIMITIVE POSITIVE INTERPRETATIONS
- Chapter 4 COUNTABLY CATEGORICAL STRUCTURES
- Chapter 5 EXAMPLES
- Chapter 6 UNIVERSAL ALGEBRA
- Chapter 7 EQUALITY CONSTRAINT SATISFACTION PROBLEMS
- Chapter 8 DATALOG
- Chapter 9 TOPOLOGY
- Chapter 10 OLIGOMORPHIC CLONES
- Chapter 11 RAMSEY THEORY
- Chapter 12 TEMPORAL CONSTRAINT SATISFACTION PROBLEMS
- Chapter 13 NON-DICHOTOMIES
- Chapter 14 CONCLUSION AND OUTLOOK
- REFERENCES
- INDEX
Frequently asked questions
Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn how to download books offline
Perlego offers two plans: Essential and Complete
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.5M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1.5 million books across 990+ topics, we’ve got you covered! Learn about our mission
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more about Read Aloud
Yes! You can use the Perlego app on both iOS and Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app
Yes, you can access Complexity of Infinite-Domain Constraint Satisfaction by Manuel Bodirsky in PDF and/or ePUB format, as well as other popular books in Mathematics & Logic in Mathematics. We have over 1.5 million books available in our catalogue for you to explore.