Complexity dichotomies for counting problems: Volume 1 Boolean domain
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counti...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2017
|
| Links: | https://doi.org/10.1017/9781107477063 |
| Zusammenfassung: | Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics. |
| Umfang: | 1 Online-Ressource (x, 461 Seiten) |
| ISBN: | 9781107477063 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781107477063 | ||
| 003 | UkCbUP | ||
| 005 | 20171120152616.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 130905s2017||||enk o ||1 0|eng|d | ||
| 020 | |a 9781107477063 | ||
| 100 | 1 | |a Cai, Jin-yi |d 1961- | |
| 245 | 1 | 0 | |a Complexity dichotomies for counting problems |n Volume 1 |p Boolean domain |c Jin-Yi Cai, University of Wisconsin, Madison, Xi Chen, Columbia University, New York, New York |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2017 | |
| 300 | |a 1 Online-Ressource (x, 461 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics. | ||
| 700 | 1 | |a Chen, Xi | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107062375 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107635609 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781107477063 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781107477063 |
|---|---|
| _version_ | 1832177784815878145 |
| adam_text | |
| any_adam_object | |
| author | Cai, Jin-yi 1961- |
| author2 | Chen, Xi |
| author2_role | |
| author2_variant | x c xc |
| author_facet | Cai, Jin-yi 1961- Chen, Xi |
| author_role | |
| author_sort | Cai, Jin-yi 1961- |
| author_variant | j y c jyc |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01788nam a2200265 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781107477063</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20171120152616.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">130905s2017||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107477063</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cai, Jin-yi</subfield><subfield code="d">1961-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity dichotomies for counting problems</subfield><subfield code="n">Volume 1</subfield><subfield code="p">Boolean domain</subfield><subfield code="c">Jin-Yi Cai, University of Wisconsin, Madison, Xi Chen, Columbia University, New York, New York</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 461 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Xi</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781107062375</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781107635609</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781107477063</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781107477063 |
| illustrated | Not Illustrated |
| indexdate | 2025-05-15T09:21:36Z |
| institution | BVB |
| isbn | 9781107477063 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (x, 461 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Cai, Jin-yi 1961- Complexity dichotomies for counting problems Volume 1 Boolean domain Jin-Yi Cai, University of Wisconsin, Madison, Xi Chen, Columbia University, New York, New York Cambridge Cambridge University Press 2017 1 Online-Ressource (x, 461 Seiten) txt c cr Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics. Chen, Xi Erscheint auch als Druck-Ausgabe 9781107062375 Erscheint auch als Druck-Ausgabe 9781107635609 |
| spellingShingle | Cai, Jin-yi 1961- Complexity dichotomies for counting problems |
| title | Complexity dichotomies for counting problems |
| title_auth | Complexity dichotomies for counting problems |
| title_exact_search | Complexity dichotomies for counting problems |
| title_full | Complexity dichotomies for counting problems Volume 1 Boolean domain Jin-Yi Cai, University of Wisconsin, Madison, Xi Chen, Columbia University, New York, New York |
| title_fullStr | Complexity dichotomies for counting problems Volume 1 Boolean domain Jin-Yi Cai, University of Wisconsin, Madison, Xi Chen, Columbia University, New York, New York |
| title_full_unstemmed | Complexity dichotomies for counting problems Volume 1 Boolean domain Jin-Yi Cai, University of Wisconsin, Madison, Xi Chen, Columbia University, New York, New York |
| title_short | Complexity dichotomies for counting problems |
| title_sort | complexity dichotomies for counting problems boolean domain |
| work_keys_str_mv | AT caijinyi complexitydichotomiesforcountingproblemsvolume1 AT chenxi complexitydichotomiesforcountingproblemsvolume1 |