Timeline for Graph addition chains
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2017 at 20:02 | answer | added | David Eppstein | timeline score: 2 | |
| May 24, 2017 at 19:38 | answer | added | Joshua Grochow | timeline score: 1 | |
| S Nov 11, 2012 at 6:07 | history | suggested | CommunityBot |
retagging the question
|
|
| Nov 11, 2012 at 6:07 | review | Suggested edits | |||
| S Nov 11, 2012 at 6:07 | |||||
| Jul 13, 2012 at 23:20 | comment | added | Tsuyoshi Ito | Not an answer, but note that the minimum length of an addition chain is nothing but the minimum size of circuits consisting of the constant-1 gate and the binary addition gate. So another way to state “graph addition chain” is a circuit where each gate has a graph as a value and each internal node performs a certain operation on graphs. | |
| Jul 13, 2012 at 22:35 | history | tweeted | twitter.com/#!/StackCSTheory/status/223908463867211776 | ||
| Jul 13, 2012 at 19:46 | history | edited | Radu Curticapean | CC BY-SA 3.0 |
fixed grammar
|
| Jul 13, 2012 at 16:24 | history | asked | Radu Curticapean | CC BY-SA 3.0 |