Advertisement

The complexity of finding minimum-length generator sequences

Extended abstract
  • Mark Jerrum
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beriekamp, E.R., Conway, J.H. and Guy, R.K. "Winning Ways. Vol. 2 — Games in Particular". Academic Press, 1982.Google Scholar
  2. 2.
    Cayley, A. Note on the Theory of Permutations. Philosophical Magazine 34 (1849), pp. 527–529.Google Scholar
  3. 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.Google Scholar
  4. 4.
    Even, S. and Goldreich, O. The Minimum-length Generator Sequence Problem is NP-hard. J. Algorithms 2 (1981), pp. 311–313.Google Scholar
  5. 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.Google Scholar
  6. 6.
    Garey, M.R. and Johnson, D.S. "Computers and Intractability — A Guide to the Theory of NP-Completeness". Freeman, San Francisco, 1979.Google Scholar
  7. 7.
    Hall, M. "The Theory of Groups". Macmilian, New York, 1959.Google Scholar
  8. 8.
    Hardy, G.H. and Wright, E.M. "An Introduction to the Theory of Numbers". Oxford, 1938.Google Scholar
  9. 9.
    Hopcroft, J.E. and Ullman, J.D. "Introduction to Automata Theory, Languages and Computation". Addison-Wesley, 1979.Google Scholar
  10. 10.
    Jerrum, M.R. A Compact Representation for Permutation Groups. Proc. 23rd IEEE Symposium on Foundations of Computer Science. 1982, pp. 126–133.Google Scholar
  11. 11.
    Jerrum, M.R. The Complexity of Finding Minimum-length Generator Sequences. Internal Report CSR-139-83. Department of Computer Science. University of Edinburgh, July, 1983. (Submitted to Theoretical Computer Science).Google Scholar
  12. 12.
    Knuth, D.E. The Art of Computer Programming. Volume 3: "Sorting and Searching". Addison-Wesley, 1973.Google Scholar
  13. 13.
    Savitch, W.J. Relationships between Nondeterministic and Deterministic Tape Complexities. J. Computer and Systems Sciences 4 (1970), pp. 177–192.Google Scholar
  14. 14.
    Sims, C.C. Computational Methods in the Study of Permutation Groups. In "Computational Problems in Abstract Algebra", Leech, J. (Ed.), Pergamon Press, 1970, pp. 169–183.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Mark Jerrum
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghEdinburghScotland

Personalised recommendations