Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/258726.258857acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article
Free access

Computing with subgroups of automorphism groups of finite groups

Published: 01 July 1997 Publication History
First page of PDF

References

[1]
BOSMA, W., CANNON, J. J., AND PLAYOUST, C. The Magma algebra system. School of Mathematics and Statistics, University of Sydney, 1996.
[2]
LYNDON, R. C., AND SCHUPP, P. E. Combinatorial Group Theory. Springer Verlag, 1977.
[3]
NEUa0SE~t, J. Untersuchungen des Untergruppenverbandes endlicher Gruppen auf einer programmgesteurten elektronischen Dualmaschine. Numer. Math. 2. (1960), 280-292.
[4]
NEWMAN, M. F., AND O'BRIEN, E. A. Application of computers to questions like those of Burnside, II. To appear in lnternat. J. Algebra Comput.
[5]
SCn6NEaT, M. GAP: Groups, Algorithms and Programming. Rheinisch Westfalische Technische Hochschule, Aachen, 1994.
[6]
StMS, C. C. Computational methods in the study of permutation groups. In Computational Problems in Abstract Algebra (1970), J. Leech, Ed., Pergamon Press, pp. 169-183.
[7]
SIMS, C. C. Computation with Finitely Presented Groups. Cambridge University Press, 1994.

Cited By

View all
  • (2010)Generalised Sifting in Black-Box GroupsLMS Journal of Computation and Mathematics10.1112/S14611570000009788(217-250)Online publication date: 1-Feb-2010

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ISSAC '97: Proceedings of the 1997 international symposium on Symbolic and algebraic computation
July 1997
414 pages
ISBN:0897918754
DOI:10.1145/258726
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1997

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

ISSAC97
Sponsor:

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)59
  • Downloads (Last 6 weeks)18
Reflects downloads up to 05 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2010)Generalised Sifting in Black-Box GroupsLMS Journal of Computation and Mathematics10.1112/S14611570000009788(217-250)Online publication date: 1-Feb-2010

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media