Scholarlink

We investigate the complexity of isomorphism testing for finite (quasi)groups, crucially taking advantage of their various decompositions to show the following.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Parallel Complexity of Identifying Groups and Quasigroups via Decompositions

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Dan Johnson,
  • Michael Levet,
  • Petr Vojtěchovský,
  • Brett Widholm

摘要

We investigate the complexity of isomorphism testing for finite (quasi)groups, crucially taking advantage of their various decompositions to show the following.