This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
AHO, A., HOPCROFT, J., ULLMAN, J., The design and analysis of Computer algorithms, Addison-Wesley (1974)
DIXON, J.D., Problems in Group theory, Dover, New York (1973)
FURST, M., HOPCROFT, J., LUKS, E., Polynomial time algorithms for permutation groups, 22nd Symposium on the Foundations of Computer Science (1980), pp 36–41
HOFFMANN, C.M., Group theoretic algorithms and graph isomorphism, Springer-Verlag (1982).
HU, T.C., Integer programming and network flows Addison-Wesley, (1969)
ILIOPOULOS, C.S., Algorithms in the theory of abelian groups, Ph.D. Thesis, Warwick Univ., (1983)
ILIOPOULOS, C.S., Analysis of algorithms on problems in general abelian groups Info. Proc. Letters, Vol 20, 4, 1985
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iliopoulos, C.S. (1985). Worst-case analysis of algorithms for computational problems on abelian permutation groups. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_268
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_268
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive