37-rule-is-optimal

Theorem: Any protocol of date problem has success probability less than which is about . Here is the biggest number such that .
Proof: First, let's introduce some notation. is the set of permutations of .
For any two permutations and , we say if and fit with the first [...]

约1371字,阅读全文

标签: , ,

guest | 注册 | 管理 | English | 繁體 | https

阅微堂

zhiqiang's personal blog
Loading...
Loading...
Loading...