On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness

Documenti analoghi

• On the Descriptive Complexity of Groups without Abelian Normal Subgroups
  di: Grochow, Joshua A., et al.
  Pubblicazione: (2022)
• On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
  di: Grochow, Joshua A., et al.
  Pubblicazione: (2021)
• Parallel Algorithms for Group Isomorphism via Code Equivalence
  di: Levet, Michael
  Pubblicazione: (2026)
• Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
  di: Levet, Michael, et al.
  Pubblicazione: (2023)
• The Word Problem for Products of Symmetric Groups
  di: Simon, Hans U.
  Pubblicazione: (2025)