Advertisement

Worst-case analysis of algorithms for computational problems on abelian permutation groups

  • Costas S. Iliopoulos
Computational Group Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    AHO, A., HOPCROFT, J., ULLMAN, J., The design and analysis of Computer algorithms, Addison-Wesley (1974)Google Scholar
  2. 2.
    DIXON, J.D., Problems in Group theory, Dover, New York (1973)Google Scholar
  3. 3.
    FURST, M., HOPCROFT, J., LUKS, E., Polynomial time algorithms for permutation groups, 22nd Symposium on the Foundations of Computer Science (1980), pp 36–41Google Scholar
  4. 4.
    HOFFMANN, C.M., Group theoretic algorithms and graph isomorphism, Springer-Verlag (1982).Google Scholar
  5. 5.
    HU, T.C., Integer programming and network flows Addison-Wesley, (1969)Google Scholar
  6. 6.
    ILIOPOULOS, C.S., Algorithms in the theory of abelian groups, Ph.D. Thesis, Warwick Univ., (1983)Google Scholar
  7. 7.
    ILIOPOULOS, C.S., Analysis of algorithms on problems in general abelian groups Info. Proc. Letters, Vol 20, 4, 1985Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Costas S. Iliopoulos
    • 1
  1. 1.Dept. of Comp. & Inf. Sci.New Jersey Inst. of Tech.Newark

Personalised recommendations