Space efficient representations of finite groups

DOI10.1016/j.jcss.2020.06.007zbMath1461.68061arXiv2002.11391OpenAlexW3041116145MaRDI QIDQ2194866

P. R. Vaidyanathan, Bireswar Das, Shivdutt Sharma

Publication date: 7 September 2020

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.11391

zbMATH Keywords

finite groupssuccinct data structuresHamiltonian groupsspace-efficient data structures

Mathematics Subject Classification ID

Data structures (68P05) Structure and classification of infinite or finite groups (20E99)

Related Items (1)

Compact data structures for Dedekind groups and finite rings

Cites Work

• Linear and sublinear time algorithms for the basis of abelian groups
• Collection from the left and other strategies
• Small-diameter Cayley graphs for finite simple groups
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism
• Probabilistic methods in group theory
• Linear time algorithms for Abelian group isomorphism and related problems
• Existence, algorithms, and asymptotics of direct product decompositions, I
• Succinct representation of finite abelian groups
• An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem
• Factoring Groups Efficiently
• Graph isomorphism in quasipolynomial time [extended abstract]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Space efficient representations of finite groups