Complexity of infinite-domain constraint satisfaction:
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 prese...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, United Kingdom ; New York, NY, USA ; Port Melbourne, VIC, Australia ; New Delhi, India ; Singapore
Cambridge University Press
2021
|
| Schriftenreihe: | Lecture notes in logic
52 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 TUM01 TUM02 Volltext |
| Zusammenfassung: | 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 28 May 2021) Introduction to constraint satisfaction problems -- Model theory -- Primitive positive interpretations -- Countably categorical structures -- Examples -- Universal algebra -- Equality constraint satisfaction problems -- Datalog -- Topology -- Oligomorphic clones -- Ramsey theory -- Temporal constraint satisfaction problems -- Non-dichotomies -- Conclusion and outlook |
| Beschreibung: | 1 Online-Ressource (ix, 524 Seiten) Illustrationen |
| ISBN: | 9781107337534 |
| DOI: | 10.1017/9781107337534 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV047341906 | ||
| 003 | DE-604 | ||
| 005 | 20230509 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 210623s2021 |||| o||u| ||||||eng d | ||
| 020 | |a 9781107337534 |c EPUB |9 978-1-107-33753-4 | ||
| 024 | 7 | |a 10.1017/9781107337534 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781107337534 | ||
| 035 | |a (OCoLC)1257811212 | ||
| 035 | |a (DE-599)BVBBV047341906 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-91G | ||
| 082 | 0 | |a 005.1/16 | |
| 084 | |a DAT 517 |2 stub | ||
| 100 | 1 | |a Bodirsky, Manuel |d 1976- |0 (DE-588)129742422 |4 aut | |
| 245 | 1 | 0 | |a Complexity of infinite-domain constraint satisfaction |c Manuel Bodirsky |
| 264 | 1 | |a Cambridge, United Kingdom ; New York, NY, USA ; Port Melbourne, VIC, Australia ; New Delhi, India ; Singapore |b Cambridge University Press |c 2021 | |
| 300 | |a 1 Online-Ressource (ix, 524 Seiten) |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in logic |v 52 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 28 May 2021) | ||
| 500 | |a Introduction to constraint satisfaction problems -- Model theory -- Primitive positive interpretations -- Countably categorical structures -- Examples -- Universal algebra -- Equality constraint satisfaction problems -- Datalog -- Topology -- Oligomorphic clones -- Ramsey theory -- Temporal constraint satisfaction problems -- Non-dichotomies -- Conclusion and outlook | ||
| 520 | |a 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 | ||
| 650 | 4 | |a Constraint programming (Computer science) | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Linear programming | |
| 650 | 4 | |a Constraints (Artificial intelligence) / Mathematics | |
| 650 | 0 | 7 | |a Constraint-Erfüllung |0 (DE-588)4580374-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Constraint-Erfüllung |0 (DE-588)4580374-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 978-1-107-04284-1 |
| 830 | 0 | |a Lecture notes in logic |v 52 |w (DE-604)BV041460285 |9 52 | |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781107337534 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032744284 | ||
| 966 | e | |u https://doi.org/10.1017/9781107337534 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781107337534 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781107337534 |l TUM01 |p ZDB-20-CBO |q TUM_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781107337534 |l TUM01 |p ZDB-20-CBO |q TUM_Paketkauf_2021 |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781107337534 |l TUM02 |p ZDB-20-CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182559033131008 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Bodirsky, Manuel 1976- |
| author_GND | (DE-588)129742422 |
| author_facet | Bodirsky, Manuel 1976- |
| author_role | aut |
| author_sort | Bodirsky, Manuel 1976- |
| author_variant | m b mb |
| building | Verbundindex |
| bvnumber | BV047341906 |
| classification_tum | DAT 517 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781107337534 (OCoLC)1257811212 (DE-599)BVBBV047341906 |
| dewey-full | 005.1/16 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1/16 |
| dewey-search | 005.1/16 |
| dewey-sort | 15.1 216 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1017/9781107337534 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03654nmm a2200541zcb4500</leader><controlfield tag="001">BV047341906</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230509 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210623s2021 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107337534</subfield><subfield code="c">EPUB</subfield><subfield code="9">978-1-107-33753-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781107337534</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781107337534</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1257811212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047341906</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1/16</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bodirsky, Manuel</subfield><subfield code="d">1976-</subfield><subfield code="0">(DE-588)129742422</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity of infinite-domain constraint satisfaction</subfield><subfield code="c">Manuel Bodirsky</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, United Kingdom ; New York, NY, USA ; Port Melbourne, VIC, Australia ; New Delhi, India ; Singapore</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (ix, 524 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in logic</subfield><subfield code="v">52</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 28 May 2021)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Introduction to constraint satisfaction problems -- Model theory -- Primitive positive interpretations -- Countably categorical structures -- Examples -- Universal algebra -- Equality constraint satisfaction problems -- Datalog -- Topology -- Oligomorphic clones -- Ramsey theory -- Temporal constraint satisfaction problems -- Non-dichotomies -- Conclusion and outlook</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraints (Artificial intelligence) / Mathematics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint-Erfüllung</subfield><subfield code="0">(DE-588)4580374-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Constraint-Erfüllung</subfield><subfield code="0">(DE-588)4580374-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">978-1-107-04284-1</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in logic</subfield><subfield code="v">52</subfield><subfield code="w">(DE-604)BV041460285</subfield><subfield code="9">52</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781107337534</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032744284</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781107337534</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781107337534</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781107337534</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781107337534</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">TUM_Paketkauf_2021</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781107337534</subfield><subfield code="l">TUM02</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047341906 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T17:34:38Z |
| indexdate | 2024-07-10T09:09:28Z |
| institution | BVB |
| isbn | 9781107337534 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032744284 |
| oclc_num | 1257811212 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-92 DE-91G DE-BY-TUM |
| physical | 1 Online-Ressource (ix, 524 Seiten) Illustrationen |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO TUM_Einzelkauf ZDB-20-CBO TUM_Paketkauf_2021 |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | Cambridge University Press |
| record_format | marc |
| series | Lecture notes in logic |
| series2 | Lecture notes in logic |
| spelling | Bodirsky, Manuel 1976- (DE-588)129742422 aut Complexity of infinite-domain constraint satisfaction Manuel Bodirsky Cambridge, United Kingdom ; New York, NY, USA ; Port Melbourne, VIC, Australia ; New Delhi, India ; Singapore Cambridge University Press 2021 1 Online-Ressource (ix, 524 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Lecture notes in logic 52 Title from publisher's bibliographic system (viewed on 28 May 2021) Introduction to constraint satisfaction problems -- Model theory -- Primitive positive interpretations -- Countably categorical structures -- Examples -- Universal algebra -- Equality constraint satisfaction problems -- Datalog -- Topology -- Oligomorphic clones -- Ramsey theory -- Temporal constraint satisfaction problems -- Non-dichotomies -- Conclusion and outlook 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 Constraint programming (Computer science) Computational complexity Linear programming Constraints (Artificial intelligence) / Mathematics Constraint-Erfüllung (DE-588)4580374-2 gnd rswk-swf Constraint-Erfüllung (DE-588)4580374-2 s DE-604 Erscheint auch als Druck-Ausgabe, Hardcover 978-1-107-04284-1 Lecture notes in logic 52 (DE-604)BV041460285 52 https://doi.org/10.1017/9781107337534 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Bodirsky, Manuel 1976- Complexity of infinite-domain constraint satisfaction Lecture notes in logic Constraint programming (Computer science) Computational complexity Linear programming Constraints (Artificial intelligence) / Mathematics Constraint-Erfüllung (DE-588)4580374-2 gnd |
| subject_GND | (DE-588)4580374-2 |
| title | Complexity of infinite-domain constraint satisfaction |
| title_auth | Complexity of infinite-domain constraint satisfaction |
| title_exact_search | Complexity of infinite-domain constraint satisfaction |
| title_exact_search_txtP | Complexity of infinite-domain constraint satisfaction |
| title_full | Complexity of infinite-domain constraint satisfaction Manuel Bodirsky |
| title_fullStr | Complexity of infinite-domain constraint satisfaction Manuel Bodirsky |
| title_full_unstemmed | Complexity of infinite-domain constraint satisfaction Manuel Bodirsky |
| title_short | Complexity of infinite-domain constraint satisfaction |
| title_sort | complexity of infinite domain constraint satisfaction |
| topic | Constraint programming (Computer science) Computational complexity Linear programming Constraints (Artificial intelligence) / Mathematics Constraint-Erfüllung (DE-588)4580374-2 gnd |
| topic_facet | Constraint programming (Computer science) Computational complexity Linear programming Constraints (Artificial intelligence) / Mathematics Constraint-Erfüllung |
| url | https://doi.org/10.1017/9781107337534 |
| volume_link | (DE-604)BV041460285 |
| work_keys_str_mv | AT bodirskymanuel complexityofinfinitedomainconstraintsatisfaction |