计算群论中的分治法

G. Butler
{"title":"计算群论中的分治法","authors":"G. Butler","doi":"10.1145/32439.32451","DOIUrl":null,"url":null,"abstract":"The paradigm of divide-and-conquer appears in five guises in computational group theory: <italic>Subgroup Restriction, Subgroup Lifting, Extension, Normal Lifting,</italic> and <italic>Homomorphic Lifting</italic>. The building blocks for these strategies are algorithms for <italic>subgroup construction, coset enumeration,</italic> and <italic>homomorphisms</italic>.","PeriodicalId":314618,"journal":{"name":"Symposium on Symbolic and Algebraic Manipulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Divide-and-conquer in computational group theory\",\"authors\":\"G. Butler\",\"doi\":\"10.1145/32439.32451\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paradigm of divide-and-conquer appears in five guises in computational group theory: <italic>Subgroup Restriction, Subgroup Lifting, Extension, Normal Lifting,</italic> and <italic>Homomorphic Lifting</italic>. The building blocks for these strategies are algorithms for <italic>subgroup construction, coset enumeration,</italic> and <italic>homomorphisms</italic>.\",\"PeriodicalId\":314618,\"journal\":{\"name\":\"Symposium on Symbolic and Algebraic Manipulation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Symbolic and Algebraic Manipulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/32439.32451\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Symbolic and Algebraic Manipulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/32439.32451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

分而治之的范式在计算群理论中有五种表现形式:子群限制、子群提升、可拓、正常提升和同态提升。这些策略的构建块是用于子群构造、协集枚举和同态的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Divide-and-conquer in computational group theory
The paradigm of divide-and-conquer appears in five guises in computational group theory: Subgroup Restriction, Subgroup Lifting, Extension, Normal Lifting, and Homomorphic Lifting. The building blocks for these strategies are algorithms for subgroup construction, coset enumeration, and homomorphisms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信