163 search results - page 2 / 33 » Composition Theorems in Communication Complexity |
SOFSEM
2009
Springer
14 years 2 months ago
2009
Springer
CSFW
2008
IEEE
13 years 12 months ago
2008
IEEE
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
QCQC
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...