Minimal sized generating sets of permutation groups
arxiv(2024)
摘要
We present a randomised variant of an algorithm of Lucchini and Thakkar for
finding a smallest sized generating set in a finite group, which has polynomial
time expected running time in finite permutation groups.
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要