Timeline for multi-party Communication complexity of "Set Partition problem"
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2015 at 19:17 | review | Late answers | |||
| Sep 29, 2015 at 19:25 | |||||
| Dec 17, 2010 at 23:55 | comment | added | Dan | For the answer to my problem, you can look at the randomized protocol to solve the Equality problem to get an idea. For example, Example 3.5 in Nissan-Kushilevitz's book. The main idea is to use fingerprinting, I guess. | |
| Dec 17, 2010 at 6:59 | comment | added | Suresh Venkat | maybe you should post another question ? | |
| Dec 16, 2010 at 21:07 | history | answered | Keren | CC BY-SA 2.5 |