Counting, sampling and integrating: algorithms and complexity:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Basel [u.a.]
Birkhäuser
2003
|
| Series: | Lectures in mathematics : ETH Zürich
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Item Description: | Literaturverz. S. 105 - 110 |
| Physical Description: | XI, 112 Seiten Diagramme |
| ISBN: | 3764369469 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV016523553 | ||
| 003 | DE-604 | ||
| 005 | 20241219 | ||
| 007 | t| | ||
| 008 | 030211s2003 gw |||| |||| 00||| eng d | ||
| 016 | 7 | |a 966197879 |2 DE-101 | |
| 020 | |a 3764369469 |9 3-7643-6946-9 | ||
| 035 | |a (OCoLC)51258302 | ||
| 035 | |a (DE-599)BVBBV016523553 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29T |a DE-355 |a DE-19 |a DE-634 |a DE-739 | ||
| 050 | 0 | |a QA164.8 | |
| 082 | 0 | |a 511/.62 |2 21 | |
| 084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
| 100 | 1 | |a Jerrum, Mark |d 1955- |e Verfasser |0 (DE-588)12443133X |4 aut | |
| 245 | 1 | 0 | |a Counting, sampling and integrating: algorithms and complexity |c Mark Jerrum |
| 264 | 1 | |a Basel [u.a.] |b Birkhäuser |c 2003 | |
| 300 | |a XI, 112 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Lectures in mathematics : ETH Zürich | |
| 500 | |a Literaturverz. S. 105 - 110 | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Complexiteit |2 gtt | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Problèmes combinatoires d'énumération | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorial enumeration problems | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Markov-Prozess |0 (DE-588)4134948-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Markov-Ketten-Monte-Carlo-Verfahren |0 (DE-588)4508520-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 1 | |a Markov-Prozess |0 (DE-588)4134948-9 |D s |
| 689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Markov-Ketten-Monte-Carlo-Verfahren |0 (DE-588)4508520-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010211529&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010211529 | |
Record in the Search Index
| _version_ | 1818888906666409984 |
|---|---|
| adam_text |
Titel: Counting, sampling and integrating: algorithms and complexity
Autor: Jerrum, Mark
Jahr: 2003
Contents
Foreword ix
1 Two good counting algorithms 1
1.1 Spanning trees. 1
1.2 Perfect matchings in a planar graph. 5
2 #P-completeness 11
2.1 The class #P. 13
2.2 A primal #P-complete problem. 15
2.3 Computing the permanent is hard on average. 21
3 Sampling and counting 25
3.1 Preliminaries. 25
3.2 Reducing approximate counting
to almost uniform sampling. 28
3.3 Markov chains . 30
4 Coupling and colourings 33
4.1 Colourings of a low-degree graph. 33
4.2 Bounding mixing time using coupling. 36
4.3 Path coupling. 41
5 Canonical paths and matchings 49
5.1 Matchings in a graph. 49
5.2 Canonical paths. 51
5.3 Back to matchings. 56
5.4 Extensions and further applications. 62
5.5 Continuous time. 63
6 Volume of a convex body 65
6.1 A few remarks on Markov chains
with continuous state space. 67
6.2 Invariant measure of the ball walk . 68
viii Contents
6.3 Mixing rate of the ball walk. 72
6.4 Proof of the Poincaré inequality (Theorem 6.7). 74
6.5 Proofs of the geometric lemmas. 82
6.6 Relaxing the curvature condition. 85
6.7 Using samples to estimate volume . 89
6.8 Appendix: a proof of Corollary 6.8. 91
7 Inapproximability 93
7.1 Independent sets in a low degree graph. 96
Bibliography 105 |
| any_adam_object | 1 |
| author | Jerrum, Mark 1955- |
| author_GND | (DE-588)12443133X |
| author_facet | Jerrum, Mark 1955- |
| author_role | aut |
| author_sort | Jerrum, Mark 1955- |
| author_variant | m j mj |
| building | Verbundindex |
| bvnumber | BV016523553 |
| callnumber-first | Q - Science |
| callnumber-label | QA164 |
| callnumber-raw | QA164.8 |
| callnumber-search | QA164.8 |
| callnumber-sort | QA 3164.8 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 820 |
| ctrlnum | (OCoLC)51258302 (DE-599)BVBBV016523553 |
| dewey-full | 511/.62 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.62 |
| dewey-search | 511/.62 |
| dewey-sort | 3511 262 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV016523553</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20241219</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">030211s2003 gw |||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">966197879</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3764369469</subfield><subfield code="9">3-7643-6946-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)51258302</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV016523553</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA164.8</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.62</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 820</subfield><subfield code="0">(DE-625)143258:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jerrum, Mark</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12443133X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Counting, sampling and integrating: algorithms and complexity</subfield><subfield code="c">Mark Jerrum</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Basel [u.a.]</subfield><subfield code="b">Birkhäuser</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 112 Seiten</subfield><subfield code="b">Diagramme</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Lectures in mathematics : ETH Zürich</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 105 - 110</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Problèmes combinatoires d'énumération</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial enumeration problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Markov-Prozess</subfield><subfield code="0">(DE-588)4134948-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Markov-Ketten-Monte-Carlo-Verfahren</subfield><subfield code="0">(DE-588)4508520-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Markov-Prozess</subfield><subfield code="0">(DE-588)4134948-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Markov-Ketten-Monte-Carlo-Verfahren</subfield><subfield code="0">(DE-588)4508520-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010211529&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010211529</subfield></datafield></record></collection> |
| id | DE-604.BV016523553 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-19T17:00:34Z |
| institution | BVB |
| isbn | 3764369469 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010211529 |
| oclc_num | 51258302 |
| open_access_boolean | |
| owner | DE-29T DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-634 DE-739 |
| owner_facet | DE-29T DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-634 DE-739 |
| physical | XI, 112 Seiten Diagramme |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Birkhäuser |
| record_format | marc |
| series2 | Lectures in mathematics : ETH Zürich |
| spelling | Jerrum, Mark 1955- Verfasser (DE-588)12443133X aut Counting, sampling and integrating: algorithms and complexity Mark Jerrum Basel [u.a.] Birkhäuser 2003 XI, 112 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Lectures in mathematics : ETH Zürich Literaturverz. S. 105 - 110 Algorithmes Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) Problèmes combinatoires d'énumération Algorithms Combinatorial enumeration problems Computational complexity Markov-Prozess (DE-588)4134948-9 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Markov-Ketten-Monte-Carlo-Verfahren (DE-588)4508520-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Graph (DE-588)4021842-9 s Markov-Prozess (DE-588)4134948-9 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Markov-Ketten-Monte-Carlo-Verfahren (DE-588)4508520-1 s HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010211529&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Jerrum, Mark 1955- Counting, sampling and integrating: algorithms and complexity Algorithmes Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) Problèmes combinatoires d'énumération Algorithms Combinatorial enumeration problems Computational complexity Markov-Prozess (DE-588)4134948-9 gnd Graph (DE-588)4021842-9 gnd Markov-Ketten-Monte-Carlo-Verfahren (DE-588)4508520-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4134948-9 (DE-588)4021842-9 (DE-588)4508520-1 (DE-588)4134751-1 |
| title | Counting, sampling and integrating: algorithms and complexity |
| title_auth | Counting, sampling and integrating: algorithms and complexity |
| title_exact_search | Counting, sampling and integrating: algorithms and complexity |
| title_full | Counting, sampling and integrating: algorithms and complexity Mark Jerrum |
| title_fullStr | Counting, sampling and integrating: algorithms and complexity Mark Jerrum |
| title_full_unstemmed | Counting, sampling and integrating: algorithms and complexity Mark Jerrum |
| title_short | Counting, sampling and integrating: algorithms and complexity |
| title_sort | counting sampling and integrating algorithms and complexity |
| topic | Algorithmes Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) Problèmes combinatoires d'énumération Algorithms Combinatorial enumeration problems Computational complexity Markov-Prozess (DE-588)4134948-9 gnd Graph (DE-588)4021842-9 gnd Markov-Ketten-Monte-Carlo-Verfahren (DE-588)4508520-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Algorithmes Algoritmen Complexiteit Complexité de calcul (Informatique) Problèmes combinatoires d'énumération Algorithms Combinatorial enumeration problems Computational complexity Markov-Prozess Graph Markov-Ketten-Monte-Carlo-Verfahren Berechnungskomplexität |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010211529&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT jerrummark countingsamplingandintegratingalgorithmsandcomplexity |