Muutke küpsiste eelistusi

E-raamat: Complexity of Infinite-Domain Constraint Satisfaction

5.00/5 (2 hinnangut Goodreads-ist)
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Logic
  • Ilmumisaeg: 10-Jun-2021
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781009158633
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 155,60 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Complexity of Infinite-Domain Constraint SatisfactionSuurem pilt
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Logic
  • Ilmumisaeg: 10-Jun-2021
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781009158633
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.

Arvustused

' this book is essential reading for anyone with the vaguest interest in computational complexity, as well as for those curious about potential applications of model theory and universal algebra. It brings together decades of intense research by different research communities in a uniform format.' Victor Lagerkvist, MathSciNet

Muu info

Introduces the universal-algebraic approach to classifying the computational complexity of constraint satisfaction problems.
1. Introduction to constraint satisfaction problems;
2. Model theory;
3. Primitive positive interpretations;
4. Countably categorical structures;
5. Examples;
6. Universal algebra;
7. Equality constraint satisfaction problems;
8. Datalog;
9. Topology;
10. Oligomorphic clones;
11. Ramsey theory;
12. Temporal constraint satisfaction problems;
13. Non-dichotomies;
14. Conclusion and outlook; References; Index.
Manuel Bodirsky is Professor at the Institute for Algebra in the Faculty of Mathematics at TU Dresden.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97810091586332e.html
Märksõnad: