Communication complexity:
Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys thi...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1997
|
| Schlagworte: | |
| Online-Zugang: | DE-12 DE-92 DE-91 Volltext |
| Zusammenfassung: | Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xiii, 189 pages) |
| ISBN: | 9780511574948 |
| DOI: | 10.1017/CBO9780511574948 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043945413 | ||
| 003 | DE-604 | ||
| 005 | 20221208 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1997 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511574948 |c Online |9 978-0-511-57494-8 | ||
| 024 | 7 | |a 10.1017/CBO9780511574948 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511574948 | ||
| 035 | |a (OCoLC)967604500 | ||
| 035 | |a (DE-599)BVBBV043945413 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-91 | ||
| 082 | 0 | |a 004.6/01/5113 |2 20 | |
| 084 | |a SK 950 |0 (DE-625)143273: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ELT 505 |2 stub | ||
| 100 | 1 | |a Kushilevitz, Eyal |e Verfasser |0 (DE-588)1204492271 |4 aut | |
| 245 | 1 | 0 | |a Communication complexity |c Eyal Kushilevitz, Noam Nisan |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1997 | |
| 300 | |a 1 online resource (xiii, 189 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 520 | |a Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory | ||
| 650 | 4 | |a Algebra, Boolean | |
| 650 | 4 | |a Logic circuits | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Logische Schaltung |0 (DE-588)4131023-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Boolesche Algebra |0 (DE-588)4146280-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kommunikation |0 (DE-588)4031883-7 |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 Kommunikation |0 (DE-588)4031883-7 |D s |
| 689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | 2 | |a Logische Schaltung |0 (DE-588)4131023-8 |D s |
| 689 | 0 | 3 | |a Boolesche Algebra |0 (DE-588)4146280-4 |D s |
| 689 | 0 | 4 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Kommunikation |0 (DE-588)4031883-7 |D s |
| 689 | 1 | 1 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 1 | 3 | |a Logische Schaltung |0 (DE-588)4131023-8 |D s |
| 689 | 1 | 4 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Nisan, Noam |d 1961- |e Sonstige |0 (DE-588)137125372 |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-56067-2 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-02983-4 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511574948 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 912 | |a ZDB-20-CBO | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-029354384 | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511574948 |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511574948 |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511574948 |l DE-91 |p ZDB-20-CBO |q TUM_Einzelkauf_2022 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1808867796341227520 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Kushilevitz, Eyal |
| author_GND | (DE-588)1204492271 (DE-588)137125372 |
| author_facet | Kushilevitz, Eyal |
| author_role | aut |
| author_sort | Kushilevitz, Eyal |
| author_variant | e k ek |
| building | Verbundindex |
| bvnumber | BV043945413 |
| classification_rvk | SK 950 ST 134 |
| classification_tum | ELT 505 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511574948 (OCoLC)967604500 (DE-599)BVBBV043945413 |
| dewey-full | 004.6/01/5113 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.6/01/5113 |
| dewey-search | 004.6/01/5113 |
| dewey-sort | 14.6 11 45113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Elektrotechnik Mathematik |
| doi_str_mv | 10.1017/CBO9780511574948 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nmm a2200000zc 4500</leader><controlfield tag="001">BV043945413</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221208</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1997 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511574948</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-57494-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511574948</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511574948</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967604500</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043945413</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-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6/01/5113</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 950</subfield><subfield code="0">(DE-625)143273:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ELT 505</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kushilevitz, Eyal</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1204492271</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Communication complexity</subfield><subfield code="c">Eyal Kushilevitz, Noam Nisan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 189 pages)</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="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic circuits</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">Logische Schaltung</subfield><subfield code="0">(DE-588)4131023-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Boolesche Algebra</subfield><subfield code="0">(DE-588)4146280-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</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">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Logische Schaltung</subfield><subfield code="0">(DE-588)4131023-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Boolesche Algebra</subfield><subfield code="0">(DE-588)4146280-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Logische Schaltung</subfield><subfield code="0">(DE-588)4131023-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nisan, Noam</subfield><subfield code="d">1961-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)137125372</subfield><subfield code="4">oth</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-0-521-56067-2</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-0-521-02983-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511574948</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</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-029354384</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511574948</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/CBO9780511574948</subfield><subfield code="l">DE-92</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/CBO9780511574948</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">TUM_Einzelkauf_2022</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043945413 |
| illustrated | Not Illustrated |
| indexdate | 2024-08-31T02:19:19Z |
| institution | BVB |
| isbn | 9780511574948 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029354384 |
| oclc_num | 967604500 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-91 DE-BY-TUM |
| owner_facet | DE-12 DE-92 DE-91 DE-BY-TUM |
| physical | 1 online resource (xiii, 189 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO TUM_Einzelkauf_2022 |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Kushilevitz, Eyal Verfasser (DE-588)1204492271 aut Communication complexity Eyal Kushilevitz, Noam Nisan Cambridge Cambridge University Press 1997 1 online resource (xiii, 189 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory Algebra, Boolean Logic circuits Computational complexity Logische Schaltung (DE-588)4131023-8 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Boolesche Algebra (DE-588)4146280-4 gnd rswk-swf Kommunikation (DE-588)4031883-7 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Kommunikation (DE-588)4031883-7 s Komplexitätstheorie (DE-588)4120591-1 s Logische Schaltung (DE-588)4131023-8 s Boolesche Algebra (DE-588)4146280-4 s Berechnungskomplexität (DE-588)4134751-1 s 1\p DE-604 Komplexität (DE-588)4135369-9 s Mathematik (DE-588)4037944-9 s 2\p DE-604 Nisan, Noam 1961- Sonstige (DE-588)137125372 oth Erscheint auch als Druck-Ausgabe 978-0-521-56067-2 Erscheint auch als Druck-Ausgabe 978-0-521-02983-4 https://doi.org/10.1017/CBO9780511574948 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Kushilevitz, Eyal Communication complexity Algebra, Boolean Logic circuits Computational complexity Logische Schaltung (DE-588)4131023-8 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Komplexität (DE-588)4135369-9 gnd Mathematik (DE-588)4037944-9 gnd Boolesche Algebra (DE-588)4146280-4 gnd Kommunikation (DE-588)4031883-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4131023-8 (DE-588)4120591-1 (DE-588)4135369-9 (DE-588)4037944-9 (DE-588)4146280-4 (DE-588)4031883-7 (DE-588)4134751-1 |
| title | Communication complexity |
| title_auth | Communication complexity |
| title_exact_search | Communication complexity |
| title_full | Communication complexity Eyal Kushilevitz, Noam Nisan |
| title_fullStr | Communication complexity Eyal Kushilevitz, Noam Nisan |
| title_full_unstemmed | Communication complexity Eyal Kushilevitz, Noam Nisan |
| title_short | Communication complexity |
| title_sort | communication complexity |
| topic | Algebra, Boolean Logic circuits Computational complexity Logische Schaltung (DE-588)4131023-8 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Komplexität (DE-588)4135369-9 gnd Mathematik (DE-588)4037944-9 gnd Boolesche Algebra (DE-588)4146280-4 gnd Kommunikation (DE-588)4031883-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Algebra, Boolean Logic circuits Computational complexity Logische Schaltung Komplexitätstheorie Komplexität Mathematik Boolesche Algebra Kommunikation Berechnungskomplexität |
| url | https://doi.org/10.1017/CBO9780511574948 |
| work_keys_str_mv | AT kushilevitzeyal communicationcomplexity AT nisannoam communicationcomplexity |