Communication complexity and applications:
Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify se...
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
[2020]
|
| Schlagwörter: | |
| Links: | https://doi.org/10.1017/9781108671644 https://doi.org/10.1017/9781108671644 https://doi.org/10.1017/9781108671644 https://doi.org/10.1017/9781108671644 https://doi.org/10.1017/9781108671644 |
| Zusammenfassung: | Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contains numerous examples, figures, and exercises to aid understanding |
| Umfang: | 1 Online-Ressource (xvii, 251 Seiten) |
| ISBN: | 9781108671644 |
| DOI: | 10.1017/9781108671644 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046436975 | ||
| 003 | DE-604 | ||
| 005 | 20231206 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200221s2020 xx o|||| 00||| eng d | ||
| 020 | |a 9781108671644 |c Online |9 978-1-108-67164-4 | ||
| 024 | 7 | |a 10.1017/9781108671644 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781108671644 | ||
| 035 | |a (OCoLC)1142706743 | ||
| 035 | |a (DE-599)BVBBV046436975 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-739 |a DE-92 | ||
| 082 | 0 | |a 511.3/52 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Rao, Anup |d 1980- |e Verfasser |0 (DE-588)1205181636 |4 aut | |
| 245 | 1 | 0 | |a Communication complexity and applications |c Anup Rao, Amir Yehudayoff |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c [2020] | |
| 264 | 4 | |c © 2020 | |
| 300 | |a 1 Online-Ressource (xvii, 251 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contains numerous examples, figures, and exercises to aid understanding | ||
| 650 | 4 | |a Computational complexity | |
| 700 | 1 | |a Yehudayoff, Amir |d 1978- |0 (DE-588)1205182268 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-108-49798-5 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108671644 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-031849094 | |
| 966 | e | |u https://doi.org/10.1017/9781108671644 |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108671644 |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO_Kauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108671644 |l DE-384 |p ZDB-20-CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108671644 |l DE-739 |p ZDB-20-CBO |q UPA_PDA_CBO_Kauf2021 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1818986526453792768 |
|---|---|
| any_adam_object | |
| author | Rao, Anup 1980- Yehudayoff, Amir 1978- |
| author_GND | (DE-588)1205181636 (DE-588)1205182268 |
| author_facet | Rao, Anup 1980- Yehudayoff, Amir 1978- |
| author_role | aut aut |
| author_sort | Rao, Anup 1980- |
| author_variant | a r ar a y ay |
| building | Verbundindex |
| bvnumber | BV046436975 |
| classification_rvk | SK 890 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781108671644 (OCoLC)1142706743 (DE-599)BVBBV046436975 |
| dewey-full | 511.3/52 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/52 |
| dewey-search | 511.3/52 |
| dewey-sort | 3511.3 252 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/9781108671644 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02798nam a2200433zc 4500</leader><controlfield tag="001">BV046436975</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20231206 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200221s2020 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108671644</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-108-67164-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108671644</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108671644</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1142706743</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046436975</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-739</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/52</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rao, Anup</subfield><subfield code="d">1980-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1205181636</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Communication complexity and applications</subfield><subfield code="c">Anup Rao, Amir Yehudayoff</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">[2020]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xvii, 251 Seiten)</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="520" ind1=" " ind2=" "><subfield code="a">Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contains numerous examples, figures, and exercises to aid understanding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yehudayoff, Amir</subfield><subfield code="d">1978-</subfield><subfield code="0">(DE-588)1205182268</subfield><subfield code="4">aut</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">978-1-108-49798-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108671644</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031849094</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108671644</subfield><subfield code="l">DE-12</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/9781108671644</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO_Kauf</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/9781108671644</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-20-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/9781108671644</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UPA_PDA_CBO_Kauf2021</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046436975 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T18:52:12Z |
| institution | BVB |
| isbn | 9781108671644 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031849094 |
| oclc_num | 1142706743 |
| open_access_boolean | |
| owner | DE-12 DE-739 DE-92 |
| owner_facet | DE-12 DE-739 DE-92 |
| physical | 1 Online-Ressource (xvii, 251 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO_Kauf ZDB-20-CBO UPA_PDA_CBO_Kauf2021 |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Rao, Anup 1980- Verfasser (DE-588)1205181636 aut Communication complexity and applications Anup Rao, Amir Yehudayoff Cambridge Cambridge University Press [2020] © 2020 1 Online-Ressource (xvii, 251 Seiten) txt rdacontent c rdamedia cr rdacarrier Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contains numerous examples, figures, and exercises to aid understanding Computational complexity Yehudayoff, Amir 1978- (DE-588)1205182268 aut Erscheint auch als Druck-Ausgabe 978-1-108-49798-5 https://doi.org/10.1017/9781108671644 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Rao, Anup 1980- Yehudayoff, Amir 1978- Communication complexity and applications Computational complexity |
| title | Communication complexity and applications |
| title_auth | Communication complexity and applications |
| title_exact_search | Communication complexity and applications |
| title_full | Communication complexity and applications Anup Rao, Amir Yehudayoff |
| title_fullStr | Communication complexity and applications Anup Rao, Amir Yehudayoff |
| title_full_unstemmed | Communication complexity and applications Anup Rao, Amir Yehudayoff |
| title_short | Communication complexity and applications |
| title_sort | communication complexity and applications |
| topic | Computational complexity |
| topic_facet | Computational complexity |
| url | https://doi.org/10.1017/9781108671644 |
| work_keys_str_mv | AT raoanup communicationcomplexityandapplications AT yehudayoffamir communicationcomplexityandapplications |