Timeline for Communication complexity for deciding associativity
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 30, 2013 at 3:39 | history | suggested | CommunityBot |
adding tags
|
|
| Apr 30, 2013 at 3:36 | review | Suggested edits | |||
| S Apr 30, 2013 at 3:39 | |||||
| Oct 13, 2010 at 23:02 | vote | accept | Sylvain Peyronnet | ||
| Oct 3, 2010 at 6:54 | comment | added | domotorp | I think this is usually called one-way comm compl, as Bob is not allowed to send any bits to Alice in you model. | |
| Oct 3, 2010 at 0:56 | answer | added | Per Vognsen | timeline score: 10 | |
| Oct 3, 2010 at 0:07 | comment | added | Sylvain Peyronnet | I edited accordingly. I am interested on randomized or deterministic stuff (but not quantum), even if practically only the deterministic framework is of importance for me (I plan to use the result to prove LB on the size of an OBDD). | |
| Oct 3, 2010 at 0:03 | history | edited | Sylvain Peyronnet | CC BY-SA 2.5 |
added 284 characters in body
|
| Oct 2, 2010 at 23:57 | comment | added | Robin Kothari | Could you explain the model in more detail? Like what inputs do Alice and Bob receive, and whether this is randomized or deterministic (or quantum)? | |
| Oct 2, 2010 at 23:45 | history | asked | Sylvain Peyronnet | CC BY-SA 2.5 |