Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Beriekamp, E.R., Conway, J.H. and Guy, R.K. "Winning Ways. Vol. 2 — Games in Particular". Academic Press, 1982.
2. Cayley, A. Note on the Theory of Permutations. Philosophical Magazine 34 (1849), pp. 527–529.
3. Driscoll, J.R. and Furst, M.L. On the Diameter of Permutation Groups. Proc. 15th ACM Symposium on Theory of Computing, 1983, pp. 152–160.
4. Even, S. and Goldreich, O. The Minimum-length Generator Sequence Problem is NP-hard. J. Algorithms 2 (1981), pp. 311–313.
5. Furst, M., Hopcroft, J. and Luks, E. Polynomial-time Algorithms for Permutation Groups. Proc. 21st IEEE Symposium on Foundations of Computer Science. IEEE. 1981, pp. 36–41.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Machine Models and Simulations;Algorithms and Complexity;1990