Title

Login

Join

Book's by Adi Shraibman

Covers

List

Lower Bounds in Communication Complexity

By: Troy Lee,Adi Shraibman

Write a review Read reviews Take a Quiz Solve Book Puzzle

Lower Bounds in Communication Complexity

By: Troy Lee,Adi Shraibman

The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph surveys lower bounds in the field of communication complexity. Our focus is on lower bounds that work by first representing the communication complexity measure in Euclidean space. That is to say, the first step in these lower bound techniques is to find a geometric complexity measure, such as rank or trace norm, that serves as a lower bound to the underlying communication complexity measure. Lower bounds on this geometric complexity measure are then found using algebraic and geometric tools.

Average ratings

N/A

5

0%

4

0%

3

0%

2

0%

1

0%

Solve jigsaw puzzle

Age

Page Count

152

Publisher

Now Publishers Inc

Published Date

ISBN 10

1601982585

ISBN 13

9781601982582

Lower Bounds in Communication Complexity

By: Troy Lee,Adi Shraibman

Write a review Read reviews Take a Quiz Solve Book Puzzle

Lower Bounds in Communication Complexity

By: Troy Lee,Adi Shraibman

The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph surveys lower bounds in the field of communication complexity. Our focus is on lower bounds that work by first representing the communication complexity measure in Euclidean space. That is to say, the first step in these lower bound techniques is to find a geometric complexity measure, such as rank or trace norm, that serves as a lower bound to the underlying communication complexity measure. Lower bounds on this geometric complexity measure are then found using algebraic and geometric tools.

Average ratings

N/A

5

0%

4

0%

3

0%

2

0%

1

0%

Solve jigsaw puzzle

Age

Page Count

152

Publisher

Now Publishers Inc

Published Date

ISBN 10

1601982585

ISBN 13

9781601982582