Timeline for How hard is it to compute the diameter and the growth function of a finite permutation group of small degree?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 15, 2013 at 9:11 | comment | added | Stefan Kohl♦ | Thanks for the reference. -- Though I don't see that the paper answers the question. The author derives bounds on the diameter of certain Cayley graphs, shows that they are sharp and says that the naive way to evaluate the bounds takes $n!$ times a polynomial operations. Though I have not read everything in full. | |
| Aug 14, 2013 at 23:24 | history | answered | Igor Rivin | CC BY-SA 3.0 |