Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-07956-1_11 | ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014 |
DocType | Volume | ISSN |
Journal | 8546 | 0302-9743 |
Citations | PageRank | References |
4 | 0.50 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Well Y. Chiu | 1 | 8 | 1.31 |
| Mario Szegedy | 2 | 3358 | 325.80 |
| Chengu Wang | 3 | 16 | 2.14 |
| Yixin Xu | 4 | 21 | 4.46 |