Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An algorithm for solving the factorization problem in permutation groups

From MaRDI portal
Publication:1264436
Jump to:navigation, search

DOI10.1006/jsco.1998.0202zbMath0909.20002OpenAlexW1972851637MaRDI QIDQ1264436

Torsten Minkwitz

Publication date: 28 January 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0202


zbMATH Keywords

permutation groupsfactorizationsefficient algorithmsSchreier-Sims methodshort wordsstrong generating sets


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (2)

Short expressions of permutations as products and cryptanalysis of the algebraic eraser ⋮ Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles


Uses Software

  • GAP



This page was built for publication: An algorithm for solving the factorization problem in permutation groups

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1264436&oldid=13366768"
Category:
  • Pages with script errors
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki