Communication complexity:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York ; Melbourne
Cambridge University Press
2006
|
| Ausgabe: | Digitally printed first paperback version |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | xiii, 189 Seiten Illustrationen |
| ISBN: | 9780521029834 052102983X |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036453702 | ||
| 003 | DE-604 | ||
| 005 | 20240830 | ||
| 007 | t | ||
| 008 | 100515s2006 a||| |||| 00||| eng d | ||
| 020 | |a 9780521029834 |c paperback |9 978-0-521-02983-4 | ||
| 020 | |a 052102983X |c paperback |9 0-521-02983-X | ||
| 035 | |a (OCoLC)705505609 | ||
| 035 | |a (DE-599)BVBBV036453702 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-703 |a DE-83 |a DE-355 | ||
| 084 | |a SK 950 |0 (DE-625)143273: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 517f |2 stub | ||
| 100 | 1 | |a Kushilevitz, Eyal |e Verfasser |0 (DE-588)1204492271 |4 aut | |
| 245 | 1 | 0 | |a Communication complexity |c Eyal Kushilevitz, Technion - Israel Institute of Technology, Haifa ; Noam Nisan, Hebrew University, Jerusalem |
| 250 | |a Digitally printed first paperback version | ||
| 264 | 1 | |a Cambridge ; New York ; Melbourne |b Cambridge University Press |c 2006 | |
| 300 | |a xiii, 189 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 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 Verfasser |0 (DE-588)137125372 |4 aut | |
| 775 | 0 | 8 | |i Äquivalent |n Druck-Ausgabe, Hardcover |z 978-0-521-56067-2 |
| 775 | 0 | 8 | |i Äquivalent |n Druck-Ausgabe, Hardcover |z 0-521-56067-5 |
| 856 | 4 | 2 | |m Digitalisierung UB Bayreuth |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020325758&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 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 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-020325758 | |
Datensatz im Suchindex
| _version_ | 1808864262826754048 |
|---|---|
| adam_text |
Contents
Preface
χ
I Two-Party Communication Complexity
1
1
Basics
3
1.1
The Model
3
1.2
Rectangles
7
1.3
Fooling Sets and Rectangle Size
10
1.4
Rank Lower Bound
13
1.5
Bibliographic Notes
14
2
More on Covers
16
2.1
Covers and Nondeterminism
16
2.2
Communication Complexity Versus Protocol Cover
19
23
Determinism Versus Nondeterminism
20
2.4
Rectangle Size and Covers
23
2.5
On Rank and Covers
25
2.6
Bibliographic Notes
27
3
Randomization
28
28
31
32
35
38
40
42
42
3.1
Basic Definitions
3.2
Randomization Versus Determinism
33
Public Coin Versus Private Coin
3.4
Distributional Complexity
3.5
Discrepancy
3.6
Bibliographic Notes
4
Advanced Topics
4.1
Direct Sum
CONTENTS
4.1.1
The Randomized Case
44
4.1.2
The Nondeterministic Case
46
4.1.3
The Deterministic Case
47
4.2
Rounds
49
4.3
Asymmetric Communication
54
4.4
Pseudorandomness
57
4.5
Reductions and Complexity Classes
58
4.6
The Disjointness Function
60
4.7
Communication with Partial Information
64
4.8
Bibliographic Notes
67
II Other Models of Communication
69
5
The Communication Complexity of Relations
71
5.1
Basic Examples
74
5.2
The Pair-Disjointness Relation
77
5.3
The fork Relation
79
5.4
Bibliographic Notes
82
6
Multiparty Communication Complexity
83
6.1
The "Number on the Forehead" Model
83
6.2
Cylinder Intersections
85
6.3
Bounds Using Ramsey Theory
87
6.4
Discrepancy Lower Bound
89
6.4.1
The Discrepancy of
GIP
91
6.5
Simultaneous Protocols
92
6.6
Bibliographic Notes
95
7
Variable Partition Models 97
7.1
Worst-Case Partition 97
7.2
Best-Case Partition
99
7.3
Best Partition with Information Overlap
101
7.4
Bibliographic Notes
103
III Applications
105
8
Networks, Communication, and VLSI
107
8.1
Bisection Width of Networks
107
8.2
Total Communication
1
Ю
83
AT2 Lower Bounds for VLSI
П2
8.4
Bibliographic Notes
113
9
Decision Trees and Data Structures
114
9.1
Decision Trees
114
VI
CONTENTS
9.2 Data
Structures
and the Cell
Probe Model 116
9.3
Dynamic Data Structures
117
9.4
Bibliographic Notes
118
10
Boolean Circuit Depth
119
10.1
Introduction
119
10.2
The Connection to Communication Complexity
121
10.3
Matching and Sr-Connectivity
124
10.4
Set Cover
126
10.5
Monotone Constant-Depth Circuits
128
10.6
Bibliographic Notes
129
11
More Boolean Circuit Lower Bounds
131
11.1
Small Circuits
131
11.2
Depth
2
Threshold Circuits
133
11.3
Size-Depth Tradeoffs: An Approach
135
11.4
ACC Circuits
136
11.5
Bibliographic Notes
137
12
Time and Space
139
12.1
Time-Space Tradeoffs for Turing Machines
139
12.2
One-Tape Turing Machines
142
123
Ordered Binary Decision Diagrams (OBDDs)
143
12.4
Width-Length Tradeoff for Branching Programs
145
12.5
Bibliographic Notes
146
13
Randomness
148
13.1
Quasirandom Graphs
148
13.2
Deterministic Amplification
150
13.3
Slightly Random Sources
152
13.4
Bibliographic Notes
154
14
Further Topics
156
156
156
157
158
158
160
162
162
163
166
vü ------
14.1
Noisy Channels
14.2
Communication-Space Tradeoffs
14.3
Privacy
14.4
Algebraic Communication Complexity
14.5
Two-Sided Cards
Index of Notation
A Mathematical Background
A.I
Asymptotics
A.2
Linear Algebra
A3
Probability Theory
CONTENTS
Answers to Selected Problems
168
Bibliography
176
Index
186
viii |
| any_adam_object | 1 |
| author | Kushilevitz, Eyal Nisan, Noam 1961- |
| author_GND | (DE-588)1204492271 (DE-588)137125372 |
| author_facet | Kushilevitz, Eyal Nisan, Noam 1961- |
| author_role | aut aut |
| author_sort | Kushilevitz, Eyal |
| author_variant | e k ek n n nn |
| building | Verbundindex |
| bvnumber | BV036453702 |
| classification_rvk | SK 950 ST 134 |
| classification_tum | DAT 517f |
| ctrlnum | (OCoLC)705505609 (DE-599)BVBBV036453702 |
| discipline | Informatik Mathematik |
| edition | Digitally printed first paperback version |
| 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">BV036453702</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240830</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100515s2006 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521029834</subfield><subfield code="c">paperback</subfield><subfield code="9">978-0-521-02983-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">052102983X</subfield><subfield code="c">paperback</subfield><subfield code="9">0-521-02983-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)705505609</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036453702</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-29T</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-355</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">DAT 517f</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, Technion - Israel Institute of Technology, Haifa ; Noam Nisan, Hebrew University, Jerusalem</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Digitally printed first paperback version</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge ; New York ; Melbourne</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiii, 189 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">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="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">Verfasser</subfield><subfield code="0">(DE-588)137125372</subfield><subfield code="4">aut</subfield></datafield><datafield tag="775" ind1="0" ind2="8"><subfield code="i">Äquivalent</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">978-0-521-56067-2</subfield></datafield><datafield tag="775" ind1="0" ind2="8"><subfield code="i">Äquivalent</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">0-521-56067-5</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</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=020325758&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020325758</subfield></datafield></record></collection> |
| id | DE-604.BV036453702 |
| illustrated | Illustrated |
| indexdate | 2024-08-31T01:23:07Z |
| institution | BVB |
| isbn | 9780521029834 052102983X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020325758 |
| oclc_num | 705505609 |
| open_access_boolean | |
| owner | DE-29T DE-703 DE-83 DE-355 DE-BY-UBR |
| owner_facet | DE-29T DE-703 DE-83 DE-355 DE-BY-UBR |
| physical | xiii, 189 Seiten Illustrationen |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Kushilevitz, Eyal Verfasser (DE-588)1204492271 aut Communication complexity Eyal Kushilevitz, Technion - Israel Institute of Technology, Haifa ; Noam Nisan, Hebrew University, Jerusalem Digitally printed first paperback version Cambridge ; New York ; Melbourne Cambridge University Press 2006 xiii, 189 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier 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- Verfasser (DE-588)137125372 aut Äquivalent Druck-Ausgabe, Hardcover 978-0-521-56067-2 Äquivalent Druck-Ausgabe, Hardcover 0-521-56067-5 Digitalisierung UB Bayreuth application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020325758&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 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 Nisan, Noam 1961- Communication 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, Technion - Israel Institute of Technology, Haifa ; Noam Nisan, Hebrew University, Jerusalem |
| title_fullStr | Communication complexity Eyal Kushilevitz, Technion - Israel Institute of Technology, Haifa ; Noam Nisan, Hebrew University, Jerusalem |
| title_full_unstemmed | Communication complexity Eyal Kushilevitz, Technion - Israel Institute of Technology, Haifa ; Noam Nisan, Hebrew University, Jerusalem |
| title_short | Communication complexity |
| title_sort | communication complexity |
| topic | 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 | Logische Schaltung Komplexitätstheorie Komplexität Mathematik Boolesche Algebra Kommunikation Berechnungskomplexität |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020325758&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT kushilevitzeyal communicationcomplexity AT nisannoam communicationcomplexity |