Linear space data structures for finite groups with constant query-time

DOI10.1007/S00453-024-01212-9MaRDI QIDQ6547214

Dhara Thakkar, Anant Kumar, Shivdutt Sharma, Bireswar Das

Publication date: 30 May 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

finite groupssimple groupscompact data structuresclassification theorem for finite simple groupsspace efficient representations

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Sylow normalizers of some simple classical groups.
• Space efficient representations of finite groups
• Compact data structures for Dedekind groups and finite rings
• Generation and random generation: from simple groups to maximal subgroups.
• On isomorphism testing of groups with normal Hall subgroups
• Linear time algorithms for Abelian group isomorphism and related problems
• A course in combinatorics.
• Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
• Polynomial-time isomorphism test for groups with abelian Sylow towers.
• Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
• Succinct representation of finite abelian groups
• Factoring Groups Efficiently
• The Finite Simple Groups
• The Number of Semigroups of Order n
• On the n^{log n} isomorphism technique (A Preliminary Report)
• The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem

This page was built for publication: Linear space data structures for finite groups with constant query-time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547214)