The Garden Hose Complexity for the Equality Function

被引：0
|
作者：
Chiu, Well Y. [1 ]
Szegedy, Mario [2 ]
Wang, Chengu [3 ]
Xu, Yixin [2 ]
机构：
[1] Natl Chiao Tung Univ, Dept Appl Math, 1001 Univ Rd, Hsinchu 300, Taiwan
[2] State Univ New Jersey, Dept Comp Sci, Piscataway, NJ 08854 USA
[3] Google Inc, Amphitheatre, CA 1600 USA
来源：
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014 | 2014年 / 8546卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The garden hose complexity is a new communication complexity introduced by H. Buhrman, S. Fehr, C. Schaffner and F. Speelman [BFSS13] to analyze position-based cryptography protocols in the quantum setting. We focus on the garden hose complexity of the equality function, and improve on the bounds of O. Margalit and A. Matsliah [MM12] with the help of a new approach and of our handmade simulated annealing based solver. We have also found beautiful symmetries of the solutions that have lead us to develop the notion of garden hose permutation groups. Then, exploiting this new concept, we get even further, although several interesting open problems remain.
引用
收藏
页码：112 / 123
页数：12
相关论文
共 50 条
12345